Submission #8823625
Source Code Expand
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < (n); ++i) #define sz(x) int(x.size()) using namespace std; #define MAX_N 100000 // int N = 3; // int x = 3; // int a[MAX_N] = {2, 2, 2}; int N; long long x; long long a[MAX_N]; int main() { cin >> N >> x; for (int i = 0; i < N; i++) { cin >> a[i]; } long long res = 0; if (a[0] > x) { res = a[0] - x; a[0] = x; } for (int i = 0; i < N - 1; i++) { if (a[i] + a[i + 1] <= x) { continue; } // while (a[i] + a[i+1] > x) { // res++; // a[i + 1]--; // } long long tmp = a[i + 1] + a[i] - x; a[i + 1] -= tmp; res += tmp; } printf("%lld\n", res); // cout << res << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | toyon |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 838 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | AC | 1 ms | 256 KB |
1_04.txt | AC | 17 ms | 1024 KB |
1_05.txt | AC | 17 ms | 1024 KB |
1_06.txt | AC | 44 ms | 1024 KB |
1_07.txt | AC | 44 ms | 1024 KB |
1_08.txt | AC | 40 ms | 1024 KB |
1_09.txt | AC | 40 ms | 1024 KB |
1_10.txt | AC | 40 ms | 1024 KB |
1_11.txt | AC | 40 ms | 1024 KB |
1_12.txt | AC | 39 ms | 1024 KB |
1_13.txt | AC | 40 ms | 1024 KB |
1_14.txt | AC | 40 ms | 1024 KB |
1_15.txt | AC | 40 ms | 1024 KB |