Submission #1691510
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; const int N = 100000; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll a[N],x,ans=0; CLR(a); int n; cin >> n >> x; FOR(i,0,n)cin >> a[i]; if(a[0]>x){ ans += a[0]-x; a[0] = x; } FOR(i,0,n-1){ ll b = a[i] + a[i+1]; if(b <= x)continue; ll c = b - x; ans += c; a[i+1] -= c; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | kenta2997 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 532 Byte |
Status | AC |
Exec Time | 12 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 | 2 ms | 1024 KB |
0_01.txt | AC | 2 ms | 1024 KB |
0_02.txt | AC | 2 ms | 1024 KB |
0_03.txt | AC | 2 ms | 1024 KB |
1_00.txt | AC | 2 ms | 1024 KB |
1_01.txt | AC | 2 ms | 1024 KB |
1_02.txt | AC | 2 ms | 1024 KB |
1_03.txt | AC | 2 ms | 1024 KB |
1_04.txt | AC | 7 ms | 1024 KB |
1_05.txt | AC | 7 ms | 1024 KB |
1_06.txt | AC | 12 ms | 1024 KB |
1_07.txt | AC | 12 ms | 1024 KB |
1_08.txt | AC | 11 ms | 1024 KB |
1_09.txt | AC | 11 ms | 1024 KB |
1_10.txt | AC | 11 ms | 1024 KB |
1_11.txt | AC | 11 ms | 1024 KB |
1_12.txt | AC | 11 ms | 1024 KB |
1_13.txt | AC | 11 ms | 1024 KB |
1_14.txt | AC | 11 ms | 1024 KB |
1_15.txt | AC | 11 ms | 1024 KB |