Submission #3615831

Source Code Expand

N, x = map(int, input().split())
A = list(map(int, input().split()))
ans = 0

if A[0] > x:
    ans += A[0] - x
    A[0] = x

for i in range(N-1):
    if A[i] + A[i+1] > x:
        dif = A[i] + A[i+1] - x
        A[i+1] -= dif
        ans += dif

print(ans)

Submission Info

Submission Time
Task C - Boxes and Candies
User taq225
Language Python (3.4.3)
Score 300
Code Size 270 Byte
Status AC
Exec Time 113 ms
Memory 14052 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 18 ms 3060 KB
0_01.txt AC 17 ms 2936 KB
0_02.txt AC 17 ms 2940 KB
0_03.txt AC 17 ms 2940 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 17 ms 2940 KB
1_02.txt AC 17 ms 3060 KB
1_03.txt AC 17 ms 3060 KB
1_04.txt AC 50 ms 4660 KB
1_05.txt AC 50 ms 4896 KB
1_06.txt AC 105 ms 14028 KB
1_07.txt AC 85 ms 14016 KB
1_08.txt AC 105 ms 13880 KB
1_09.txt AC 102 ms 14000 KB
1_10.txt AC 101 ms 13900 KB
1_11.txt AC 84 ms 13888 KB
1_12.txt AC 102 ms 13812 KB
1_13.txt AC 113 ms 13956 KB
1_14.txt AC 107 ms 14052 KB
1_15.txt AC 111 ms 13968 KB