Submission #4043224
Source Code Expand
N,x=map(int,input().split()) A=list(map(int,input().split()))+[0] ans=0 for i in range(N): if A[i]+A[i+1]>x: eat=A[i+1]+A[i]-x if eat>A[i+1] and eat>A[i]: if A[i]>A[i+1]: A[i]=0 A[i+1]-=eat-A[i] else: A[i+1]=0 A[i]-=eat-A[i] elif A[i+1]>=A[i]: A[i+1]-=eat else: A[i]-=eat ans+=eat print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | KoyanagiHitoshi |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 465 Byte |
Status | WA |
Exec Time | 140 ms |
Memory | 14544 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 | 17 ms | 3064 KB |
0_01.txt | AC | 17 ms | 3064 KB |
0_02.txt | AC | 17 ms | 3064 KB |
0_03.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 17 ms | 3064 KB |
1_01.txt | AC | 17 ms | 3064 KB |
1_02.txt | AC | 17 ms | 3064 KB |
1_03.txt | AC | 17 ms | 3064 KB |
1_04.txt | AC | 50 ms | 4660 KB |
1_05.txt | AC | 50 ms | 4896 KB |
1_06.txt | AC | 138 ms | 14400 KB |
1_07.txt | AC | 99 ms | 14400 KB |
1_08.txt | WA | 130 ms | 13880 KB |
1_09.txt | WA | 131 ms | 14000 KB |
1_10.txt | WA | 127 ms | 13900 KB |
1_11.txt | WA | 97 ms | 13888 KB |
1_12.txt | AC | 130 ms | 13900 KB |
1_13.txt | AC | 136 ms | 14544 KB |
1_14.txt | AC | 133 ms | 14428 KB |
1_15.txt | AC | 140 ms | 13972 KB |