Submission #3615779

Source Code Expand

# ARC64 Boxes and Candies
N, x = map(int, input().split())
A = list(map(int, input().split()))
n_eat = 0

if A[0] > x:
    n_eat += A[0]
    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
        n_eat += dif

print(n_eat)

Submission Info

Submission Time
Task C - Boxes and Candies
User taq225
Language Python (3.4.3)
Score 0
Code Size 301 Byte
Status WA
Exec Time 110 ms
Memory 14052 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 14
WA × 6
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 2940 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 3060 KB
1_03.txt AC 17 ms 3060 KB
1_04.txt AC 51 ms 4660 KB
1_05.txt AC 52 ms 4660 KB
1_06.txt AC 108 ms 14020 KB
1_07.txt AC 85 ms 14024 KB
1_08.txt WA 104 ms 13948 KB
1_09.txt WA 101 ms 14000 KB
1_10.txt AC 102 ms 13900 KB
1_11.txt AC 85 ms 14016 KB
1_12.txt WA 103 ms 13900 KB
1_13.txt WA 107 ms 14044 KB
1_14.txt WA 110 ms 14052 KB
1_15.txt WA 110 ms 13968 KB