Submission #4043249

Source Code Expand

N,x=map(int,input().split())
A=list(map(int,input().split()))+[0]
ans=0
for i in range(N):
    eated=max(0,A[i]+A[i-1]-x)
    ans+=eated
    A[i]-=eated
print(ans)

Submission Info

Submission Time
Task C - Boxes and Candies
User KoyanagiHitoshi
Language Python (3.4.3)
Score 300
Code Size 170 Byte
Status AC
Exec Time 114 ms
Memory 14252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 20
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 3060 KB
0_01.txt AC 17 ms 3060 KB
0_02.txt AC 17 ms 3060 KB
0_03.txt AC 17 ms 3060 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 17 ms 3060 KB
1_02.txt AC 17 ms 2940 KB
1_03.txt AC 17 ms 2940 KB
1_04.txt AC 86 ms 4660 KB
1_05.txt AC 86 ms 4660 KB
1_06.txt AC 99 ms 14020 KB
1_07.txt AC 104 ms 14024 KB
1_08.txt AC 100 ms 13880 KB
1_09.txt AC 106 ms 14000 KB
1_10.txt AC 98 ms 14160 KB
1_11.txt AC 102 ms 14020 KB
1_12.txt AC 96 ms 13812 KB
1_13.txt AC 102 ms 13956 KB
1_14.txt AC 101 ms 14052 KB
1_15.txt AC 114 ms 14252 KB