Submission #183314
Source Code Expand
#include <stdlib.h> #include <vector> #include <list> #include <map> #include <set> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define CLR(a) memset((a), 0 ,sizeof(a)) #define REP(i,n) for(int i = 0; i < (int)(n); ++i) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //conversion //------------------------------------------ inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; int D[7],J[7]; int main(){ CLR(D);CLR(J); REP(i,7)cin>>D[i]; REP(i,7)cin>>J[i]; int res=0; REP(i,7)res+=max(D[i],J[i]); cout<<res<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | blue0620 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1477 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt |
All | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample-01.txt | AC | 21 ms | 800 KB |
subtask0_sample-02.txt | AC | 21 ms | 800 KB |
subtask0_sample-03.txt | AC | 20 ms | 804 KB |
subtask0_sample-04.txt | AC | 20 ms | 804 KB |
subtask1_01.txt | AC | 20 ms | 796 KB |
subtask1_02.txt | AC | 20 ms | 716 KB |
subtask1_03.txt | AC | 20 ms | 796 KB |
subtask1_04.txt | AC | 21 ms | 804 KB |
subtask1_05.txt | AC | 19 ms | 920 KB |
subtask1_06.txt | AC | 20 ms | 764 KB |
subtask1_07.txt | AC | 21 ms | 800 KB |
subtask1_08.txt | AC | 20 ms | 800 KB |
subtask1_09.txt | AC | 20 ms | 800 KB |
subtask1_10.txt | AC | 20 ms | 804 KB |
subtask1_11.txt | AC | 22 ms | 792 KB |
subtask1_12.txt | AC | 21 ms | 916 KB |
subtask1_13.txt | AC | 20 ms | 800 KB |
subtask1_14.txt | AC | 20 ms | 672 KB |
subtask1_15.txt | AC | 19 ms | 924 KB |