Submission #183309
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <stack> #include <queue> #include <deque> #include <algorithm> #include <utility> #include <functional> #include <sstream> #include <iostream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <climits> #include <cassert> #include <memory> #include <time.h> using namespace std; 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 vector<int> vi; typedef vector<vi> vvi; typedef vector<string> vs; typedef pair<int, int> pii; typedef long long ll; #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() #define EXIST(s,e) ((s).find(e)!=(s).end()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) const double EPS = 1e-9; const double PI = acos(-1.0); int main(){ vi d(7),j(7); REP(i,7){ cin>>d[i]; } REP(i,7){ cin>>j[i]; } int ans=0; REP(i,7){ ans+=max(d[i],j[i]); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | SSJJ |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1181 Byte |
Status | AC |
Exec Time | 23 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 | 23 ms | 916 KB |
subtask0_sample-02.txt | AC | 21 ms | 920 KB |
subtask0_sample-03.txt | AC | 21 ms | 800 KB |
subtask0_sample-04.txt | AC | 21 ms | 932 KB |
subtask1_01.txt | AC | 21 ms | 756 KB |
subtask1_02.txt | AC | 21 ms | 924 KB |
subtask1_03.txt | AC | 21 ms | 800 KB |
subtask1_04.txt | AC | 21 ms | 816 KB |
subtask1_05.txt | AC | 22 ms | 932 KB |
subtask1_06.txt | AC | 21 ms | 920 KB |
subtask1_07.txt | AC | 21 ms | 928 KB |
subtask1_08.txt | AC | 21 ms | 800 KB |
subtask1_09.txt | AC | 21 ms | 800 KB |
subtask1_10.txt | AC | 20 ms | 796 KB |
subtask1_11.txt | AC | 21 ms | 804 KB |
subtask1_12.txt | AC | 21 ms | 804 KB |
subtask1_13.txt | AC | 21 ms | 928 KB |
subtask1_14.txt | AC | 21 ms | 800 KB |
subtask1_15.txt | AC | 21 ms | 804 KB |