Submission #1387680
Source Code Expand
# -*- coding: utf-8 -*- import math import sys import itertools import numpy as np import functools import collections mo = 1000000007 r = range n, x = map(int, input().split()) # n行x列の配列を取得 a = np.array(list(map(int, input().split()))) ret = 0 for i in r(1, n): for j in r(2): if a[i] + a[i-1] > x: tmp = min(a[i-j], a[i] + a[i-1] - x) ret += tmp a[i-j] -= tmp print(ret)
Submission Info
Submission Time | |
---|---|
Task | C - Boxes and Candies |
User | hamko |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 461 Byte |
Status | AC |
Exec Time | 860 ms |
Memory | 23136 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 146 ms | 12508 KB |
0_01.txt | AC | 146 ms | 12380 KB |
0_02.txt | AC | 146 ms | 12380 KB |
0_03.txt | AC | 147 ms | 12380 KB |
1_00.txt | AC | 146 ms | 12380 KB |
1_01.txt | AC | 146 ms | 12380 KB |
1_02.txt | AC | 146 ms | 12380 KB |
1_03.txt | AC | 147 ms | 12380 KB |
1_04.txt | AC | 489 ms | 14132 KB |
1_05.txt | AC | 442 ms | 14132 KB |
1_06.txt | AC | 803 ms | 23100 KB |
1_07.txt | AC | 664 ms | 23092 KB |
1_08.txt | AC | 833 ms | 22960 KB |
1_09.txt | AC | 778 ms | 22948 KB |
1_10.txt | AC | 735 ms | 22916 KB |
1_11.txt | AC | 614 ms | 22920 KB |
1_12.txt | AC | 837 ms | 22780 KB |
1_13.txt | AC | 860 ms | 22972 KB |
1_14.txt | AC | 810 ms | 23136 KB |
1_15.txt | AC | 836 ms | 23036 KB |