Submission #3215205
Source Code Expand
N = int(input()) A = list(map(int,input().split())) A.insert(0,0) A.insert(N+1,0) S = 0 for i in range(N+1): S += abs(A[i]-A[i+1]) for i in range(1,N+1): print(S-abs(A[i-1]-A[i])-abs(A[i]-A[i+1])+abs(A[i-1]-A[i+1]))
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | Syuko4omi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 227 Byte |
Status | AC |
Exec Time | 219 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 | 219 ms | 13916 KB |
02.txt | AC | 212 ms | 13912 KB |
03.txt | AC | 17 ms | 3064 KB |
04.txt | AC | 217 ms | 13792 KB |
05.txt | AC | 217 ms | 13920 KB |
06.txt | AC | 212 ms | 14048 KB |
07.txt | AC | 212 ms | 13920 KB |
08.txt | AC | 208 ms | 13792 KB |
09.txt | AC | 212 ms | 11784 KB |
10.txt | AC | 200 ms | 11908 KB |
11.txt | AC | 198 ms | 11784 KB |
12.txt | AC | 204 ms | 11916 KB |
sample-01.txt | AC | 17 ms | 3060 KB |
sample-02.txt | AC | 17 ms | 3060 KB |
sample-03.txt | AC | 17 ms | 3064 KB |