Submission #3391867
Source Code Expand
n = int(input()) a = list(map(int,input().split())) cost = 0 i = 0 for i in range(0,n-1,3): if i + 3 <= n-1: cost += min(abs(a[i+1]-a[i])+ abs(a[i+3]-a[i+1]), abs(a[i+2]-a[i])+ abs(a[i+3]-a[i+2])) elif i + 2 <= n-1: cost += min(abs(a[i+1]-a[i]), abs((a[i+2]-a[i]))) else: cost += abs(a[i+1]-a[i]) print(cost)
Submission Info
Submission Time | |
---|---|
Task | C - 柱柱柱柱柱 |
User | ryosuke07117 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 345 Byte |
Status | WA |
Exec Time | 80 ms |
Memory | 13908 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 | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | WA | 17 ms | 3064 KB |
subtask1_01.txt | AC | 17 ms | 3064 KB |
subtask1_02.txt | WA | 17 ms | 3064 KB |
subtask1_03.txt | WA | 17 ms | 3064 KB |
subtask1_04.txt | WA | 80 ms | 13716 KB |
subtask1_05.txt | WA | 80 ms | 13908 KB |
subtask1_06.txt | WA | 80 ms | 13908 KB |
subtask1_07.txt | WA | 80 ms | 13904 KB |