Submission #2382920
Source Code Expand
n = int(input()) a = list(map(int,input().split())) a.append(0) a.insert(0,0) b = 0 for i in range(n+1): b += abs(a[i]-a[i+1]) for i in range(1,n+1): c = b + abs(a[i-1]-a[i+1]) - abs(a[i]-a[i+1])-abs(a[i]-a[i-1]) print(c)
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | toku |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 242 Byte |
Status | AC |
Exec Time | 222 ms |
Memory | 14048 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 | 210 ms | 13916 KB |
02.txt | AC | 218 ms | 13912 KB |
03.txt | AC | 17 ms | 3064 KB |
04.txt | AC | 215 ms | 14048 KB |
05.txt | AC | 209 ms | 13792 KB |
06.txt | AC | 211 ms | 13792 KB |
07.txt | AC | 219 ms | 13920 KB |
08.txt | AC | 217 ms | 13792 KB |
09.txt | AC | 214 ms | 11796 KB |
10.txt | AC | 211 ms | 12284 KB |
11.txt | AC | 213 ms | 11792 KB |
12.txt | AC | 222 ms | 11920 KB |
sample-01.txt | AC | 17 ms | 3064 KB |
sample-02.txt | AC | 17 ms | 3060 KB |
sample-03.txt | AC | 17 ms | 3064 KB |