Submission #4021855
Source Code Expand
#include <bits/stdc++.h> #include <assert.h> using namespace std; int main() { long long N, x; cin >> N >> x; vector<long long> a(N); for (int i = 0; i < N; i++) cin >> a[i]; long long ans = 0; long long bef[2] = {}; for (int i = 0; i < N; i++) if (i % 2 == 0) { if (x < bef[0] + a[i]) { long long t = bef[0] + a[i] - x; ans += t; bef[0] = a[i] - t; } else bef[0] = a[i]; } else { if (x < bef[1] + a[i]) { long long t = bef[1] + a[i] - x; ans += t; bef[1] = a[i] - t; } else bef[1] = a[i]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | ecto0310 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 727 Byte |
Status | WA |
Exec Time | 44 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | WA | 1 ms | 256 KB |
1_04.txt | AC | 18 ms | 1024 KB |
1_05.txt | AC | 18 ms | 1024 KB |
1_06.txt | AC | 44 ms | 1024 KB |
1_07.txt | AC | 44 ms | 1024 KB |
1_08.txt | WA | 40 ms | 1024 KB |
1_09.txt | WA | 40 ms | 1024 KB |
1_10.txt | WA | 40 ms | 1024 KB |
1_11.txt | WA | 40 ms | 1024 KB |
1_12.txt | AC | 39 ms | 1024 KB |
1_13.txt | AC | 41 ms | 1024 KB |
1_14.txt | AC | 41 ms | 1024 KB |
1_15.txt | AC | 41 ms | 1024 KB |