Submission #183611
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <deque> #include <list> #include <algorithm> #include <functional> #include <sstream> #include <complex> #include <stack> #include <queue> using namespace std; //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();} //math //------------------------------------------- template<class T> inline T sqr(T x) {return x*x;} //typedef typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //#define typeof(X) std::identity<decltype(X)>::type //------------------------------------------ #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()) //repetition #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //constant const double EPS = 1e-5; const double PI = acos(-1.0); //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main(void){ cin.tie(0); ios::sync_with_stdio(false); int d[7]; int j[7]; int ans=0; REP(i,7){ cin>>d[i]; } REP(i,7){ cin>>j[i]; } REP(i,7){ ans += max(d[i],j[i]); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | calc |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1841 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 932 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 | 760 KB |
subtask0_sample-02.txt | AC | 21 ms | 756 KB |
subtask0_sample-03.txt | AC | 21 ms | 800 KB |
subtask0_sample-04.txt | AC | 20 ms | 800 KB |
subtask1_01.txt | AC | 21 ms | 800 KB |
subtask1_02.txt | AC | 22 ms | 796 KB |
subtask1_03.txt | AC | 21 ms | 928 KB |
subtask1_04.txt | AC | 21 ms | 788 KB |
subtask1_05.txt | AC | 21 ms | 928 KB |
subtask1_06.txt | AC | 21 ms | 928 KB |
subtask1_07.txt | AC | 21 ms | 932 KB |
subtask1_08.txt | AC | 21 ms | 932 KB |
subtask1_09.txt | AC | 21 ms | 932 KB |
subtask1_10.txt | AC | 21 ms | 932 KB |
subtask1_11.txt | AC | 21 ms | 924 KB |
subtask1_12.txt | AC | 21 ms | 928 KB |
subtask1_13.txt | AC | 21 ms | 932 KB |
subtask1_14.txt | AC | 20 ms | 800 KB |
subtask1_15.txt | AC | 20 ms | 792 KB |