Submission #183308
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <numeric> #include <set> #include <map> #include <string> #include <stack> #include <queue> #include <cmath> #include <cstdio> #include <istream> #include <sstream> #include <iomanip> #include <iterator> #include <climits> using namespace std; typedef ostringstream OSS; typedef istringstream ISS; typedef vector<int> VI; typedef vector< VI > VVI; typedef long long LL; typedef pair<int, int> PII; typedef vector<PII> VPII; #define X first #define Y second const LL MOD = 1000000007; template<typename T> void dump(T a, int n) { for (int i = 0; i < n; i++) cout << a[i] << (i == n - 1 ? '\n' : ' '); } template<typename T> void dump(T a) { dump<T>(a, a.size()); } int main(void) { VI D(7), J(7); for (auto &d : D) { cin >> d; } for (auto &j : J) { cin >> j; } int ans = 0; for (int i = 0; i < 7; i++) { ans += max(D[i], J[i]); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ゴールドラッシュ |
User | snakazawa |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1018 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 | 20 ms | 908 KB |
subtask0_sample-02.txt | AC | 22 ms | 916 KB |
subtask0_sample-03.txt | AC | 22 ms | 796 KB |
subtask0_sample-04.txt | AC | 21 ms | 908 KB |
subtask1_01.txt | AC | 21 ms | 920 KB |
subtask1_02.txt | AC | 21 ms | 916 KB |
subtask1_03.txt | AC | 21 ms | 908 KB |
subtask1_04.txt | AC | 20 ms | 696 KB |
subtask1_05.txt | AC | 22 ms | 848 KB |
subtask1_06.txt | AC | 22 ms | 924 KB |
subtask1_07.txt | AC | 21 ms | 916 KB |
subtask1_08.txt | AC | 22 ms | 744 KB |
subtask1_09.txt | AC | 20 ms | 916 KB |
subtask1_10.txt | AC | 19 ms | 920 KB |
subtask1_11.txt | AC | 20 ms | 908 KB |
subtask1_12.txt | AC | 21 ms | 916 KB |
subtask1_13.txt | AC | 22 ms | 920 KB |
subtask1_14.txt | AC | 22 ms | 796 KB |
subtask1_15.txt | AC | 21 ms | 780 KB |