Submission #1308128
Source Code Expand
N = int(raw_input()) a = map(int, raw_input().split()) dp = [-1 for i in range(N)] def dfs(i): if i >= N-1: return 0 elif i == N-2: return abs(a[i+1] - a[i]) elif dp[i] != -1: return dp[i] else: dp[i] = min( dfs(i+1) + abs(a[i+1] - a[i]), dfs(i+2) + abs(a[i+2] - a[i]) ) return dp[i] print dfs(0)
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | namakemono |
Language | Python (2.7.6) |
Score | 0 |
Code Size | 402 Byte |
Status | RE |
Exec Time | 77 ms |
Memory | 11168 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 10 ms | 2568 KB |
sample_02.txt | AC | 10 ms | 2568 KB |
sample_03.txt | AC | 10 ms | 2568 KB |
subtask1_01.txt | AC | 10 ms | 2568 KB |
subtask1_02.txt | AC | 10 ms | 2568 KB |
subtask1_03.txt | AC | 10 ms | 2568 KB |
subtask1_04.txt | RE | 77 ms | 11168 KB |
subtask1_05.txt | RE | 65 ms | 11168 KB |
subtask1_06.txt | RE | 65 ms | 11168 KB |
subtask1_07.txt | RE | 65 ms | 11168 KB |