Submission #4050849
Source Code Expand
#include <iostream> using namespace std; #define ll long long ll c[100001],N,M,ans; int main() { cin >> N >> M; for(int i=0; i<N; i++) cin >> c[i]; for(int i=0; i<N-1; i++) { if(c[i+1]+c[i]<=M) continue; else { if(c[i+1]>=1&&M-c[i]>=0) { ll t=c[i+1]; c[i+1]=M-c[i]; ans+=t-c[i+1]; } else { ll t=c[i]; c[i]=M-c[i+1]; ans+=t-c[i]; } } } cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | mulijoa |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 444 Byte |
Status | WA |
Exec Time | 50 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 | AC | 1 ms | 256 KB |
1_04.txt | AC | 17 ms | 1024 KB |
1_05.txt | AC | 17 ms | 1024 KB |
1_06.txt | WA | 44 ms | 1024 KB |
1_07.txt | AC | 50 ms | 1024 KB |
1_08.txt | WA | 40 ms | 1024 KB |
1_09.txt | WA | 40 ms | 1024 KB |
1_10.txt | AC | 40 ms | 1024 KB |
1_11.txt | AC | 40 ms | 1024 KB |
1_12.txt | WA | 39 ms | 1024 KB |
1_13.txt | WA | 41 ms | 1024 KB |
1_14.txt | WA | 41 ms | 1024 KB |
1_15.txt | WA | 41 ms | 1024 KB |