Submission #2865866
Source Code Expand
n = int(input()) a = list(map(int,input().split())) list=[0] list += a list += [0] sum=0 for i in range(n+1): sum += abs(list[i] - list[i+1]) for i in range(1,n+1): ans = 0 ans = sum - abs(list[i] - list[i - 1]) -abs(list[i + 1] - list[i]) + abs(list[i + 1] - list[i - 1]) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | plusn |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 316 Byte |
Status | AC |
Exec Time | 228 ms |
Memory | 13916 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 220 ms | 13916 KB |
02.txt | AC | 215 ms | 13912 KB |
03.txt | AC | 17 ms | 3064 KB |
04.txt | AC | 220 ms | 13792 KB |
05.txt | AC | 217 ms | 13792 KB |
06.txt | AC | 222 ms | 13792 KB |
07.txt | AC | 218 ms | 13792 KB |
08.txt | AC | 216 ms | 13792 KB |
09.txt | AC | 207 ms | 11788 KB |
10.txt | AC | 213 ms | 11908 KB |
11.txt | AC | 222 ms | 11796 KB |
12.txt | AC | 228 ms | 11788 KB |
sample-01.txt | AC | 17 ms | 3064 KB |
sample-02.txt | AC | 17 ms | 3064 KB |
sample-03.txt | AC | 17 ms | 3064 KB |