Submission #349076
Source Code Expand
#include <cstdio> #include <iostream> #include <vector> #include <algorithm> #include <cassert> using namespace std; typedef long long ll; const int MN = 200200; const ll MD = 1e9+7; //int d[MN]; ll r; int set(int i, int x) { } int sum() { } ll s[MN]; int main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%lld", s+i); } r = 0; if (n % 2) { s[n] = 1LL<<55; r -= 1LL<<55; n++; } r += s[0]; s[0] = 0; ll mi = 1LL<<55; for (int i = n-1; i >= 0; i--) { if (!(i % 2)) { r += max(s[i], mi); } mi = min(mi, s[i]); } printf("%lld\n", r); int q; scanf("%d", &q); assert(!q); // for (int i = 0; i < q; i++) { // int p, d; // scanf("%d %d", &p, &d); // } }
Submission Info
Submission Time | |
---|---|
Task | D - コインの取り合い |
User | yosupo |
Language | C++11 (GCC 4.8.1) |
Score | 10 |
Code Size | 884 Byte |
Status | RE |
Exec Time | 366 ms |
Memory | 2932 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:27:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:29:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", s+i); ^ ./Main.cpp:51:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &q); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 10 / 10 | 0 / 80 | 0 / 90 | ||||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt |
Subtask2 | sample_01.txt, sample_02.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Subtask3 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | RE | 322 ms | 1252 KB |
sample_02.txt | RE | 284 ms | 1308 KB |
subtask1_01.txt | AC | 29 ms | 1308 KB |
subtask1_02.txt | AC | 74 ms | 2788 KB |
subtask1_03.txt | AC | 65 ms | 2404 KB |
subtask1_04.txt | AC | 73 ms | 2784 KB |
subtask1_05.txt | AC | 75 ms | 2784 KB |
subtask1_06.txt | AC | 57 ms | 2784 KB |
subtask1_07.txt | AC | 73 ms | 2784 KB |
subtask2_01.txt | RE | 274 ms | 1248 KB |
subtask2_02.txt | RE | 289 ms | 2020 KB |
subtask2_03.txt | RE | 309 ms | 2784 KB |
subtask2_04.txt | RE | 309 ms | 2784 KB |
subtask2_05.txt | RE | 310 ms | 2784 KB |
subtask2_06.txt | RE | 310 ms | 2784 KB |
subtask2_07.txt | RE | 317 ms | 2788 KB |
subtask2_08.txt | AC | 122 ms | 2784 KB |
subtask2_09.txt | RE | 366 ms | 1888 KB |
subtask2_10.txt | RE | 315 ms | 2784 KB |
subtask2_11.txt | RE | 317 ms | 2780 KB |
subtask2_12.txt | RE | 312 ms | 2784 KB |
subtask3_01.txt | RE | 291 ms | 1632 KB |
subtask3_02.txt | RE | 331 ms | 2784 KB |
subtask3_03.txt | RE | 327 ms | 2932 KB |
subtask3_04.txt | RE | 321 ms | 2776 KB |
subtask3_05.txt | AC | 58 ms | 2784 KB |
subtask3_06.txt | RE | 326 ms | 2784 KB |
subtask3_07.txt | RE | 327 ms | 2784 KB |
subtask3_08.txt | RE | 321 ms | 2780 KB |
subtask3_09.txt | RE | 326 ms | 2784 KB |
subtask3_10.txt | RE | 316 ms | 2784 KB |
subtask3_11.txt | RE | 305 ms | 2140 KB |
subtask3_12.txt | RE | 320 ms | 2788 KB |
subtask3_13.txt | RE | 320 ms | 2788 KB |
subtask3_14.txt | RE | 324 ms | 2788 KB |