Submission #1440693
Source Code Expand
N = int(input()) A = [int(x) for x in input().split()] C = [0 for i in range(N)] C[1] = abs(A[1] - A[0]) for i in range(N-2): C[i+2] = min( C[i]+abs(A[i+2]-A[i]), C[i+1]+abs(A[i+2]-A[i+1]) ) print(C[-1])
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | IKKO_Ohta |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 262 Byte |
Status | AC |
Exec Time | 140 ms |
Memory | 13780 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 3060 KB |
subtask1_01.txt | AC | 17 ms | 3064 KB |
subtask1_02.txt | AC | 17 ms | 3064 KB |
subtask1_03.txt | AC | 17 ms | 3064 KB |
subtask1_04.txt | AC | 140 ms | 13716 KB |
subtask1_05.txt | AC | 131 ms | 13780 KB |
subtask1_06.txt | AC | 132 ms | 13716 KB |
subtask1_07.txt | AC | 133 ms | 13780 KB |