Submission #4043112


Source Code Expand

N,x=map(int,input().split())
A=list(map(int,input().split()))
ans=0
for i in range(N-1):
    if A[i]+A[i+1]>x:
        eat=A[i+1]+A[i]-x
        A[i+1]=max(A[i+1],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 208 Byte
Status WA
Exec Time 148 ms
Memory 14252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 12
WA × 8
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 18 ms 3060 KB
0_01.txt AC 18 ms 3060 KB
0_02.txt AC 18 ms 2940 KB
0_03.txt AC 18 ms 2940 KB
1_00.txt AC 18 ms 3060 KB
1_01.txt AC 18 ms 3060 KB
1_02.txt AC 18 ms 3060 KB
1_03.txt AC 18 ms 3060 KB
1_04.txt AC 52 ms 4660 KB
1_05.txt AC 51 ms 4660 KB
1_06.txt AC 104 ms 14024 KB
1_07.txt AC 107 ms 14024 KB
1_08.txt WA 132 ms 13880 KB
1_09.txt WA 133 ms 14000 KB
1_10.txt WA 131 ms 13900 KB
1_11.txt WA 100 ms 14016 KB
1_12.txt WA 140 ms 13812 KB
1_13.txt WA 143 ms 13956 KB
1_14.txt WA 148 ms 14052 KB
1_15.txt WA 139 ms 14252 KB