Submission #1357924
Source Code Expand
def ri(): return int(input()) def rli(): return list(map(int, input().split())) def ris(): return list(input()) def pli(): return "".join(list(map(str, ans))) N, x = rli() a = rli() dp = [2000000000001 for i in range(N)] for i in range(N): mi = 2000000000001 for j in range(N): mi = min(mi, a[i-j]+x*j) if(i == 0): dp[i] = mi else: dp[i] = mi + dp[i-1] print(dp[-1])
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Slimes |
User | AokabiC |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 428 Byte |
Status | WA |
Exec Time | 1991 ms |
Memory | 3188 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.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, 1_16.txt, 1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 17 ms | 3064 KB |
0_01.txt | WA | 17 ms | 3060 KB |
0_02.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 1603 ms | 3060 KB |
1_01.txt | AC | 1740 ms | 3064 KB |
1_02.txt | AC | 1589 ms | 3188 KB |
1_03.txt | AC | 1590 ms | 3188 KB |
1_04.txt | WA | 1565 ms | 3188 KB |
1_05.txt | AC | 1805 ms | 3188 KB |
1_06.txt | WA | 1579 ms | 3188 KB |
1_07.txt | AC | 1991 ms | 3188 KB |
1_08.txt | WA | 1718 ms | 3188 KB |
1_09.txt | AC | 1566 ms | 3188 KB |
1_10.txt | WA | 1190 ms | 3188 KB |
1_11.txt | WA | 1525 ms | 3188 KB |
1_12.txt | WA | 1429 ms | 3188 KB |
1_13.txt | WA | 1198 ms | 3188 KB |
1_14.txt | WA | 1613 ms | 3188 KB |
1_15.txt | WA | 1208 ms | 3188 KB |
1_16.txt | WA | 1439 ms | 3188 KB |
1_17.txt | WA | 1551 ms | 3188 KB |