Submission #3724487
Source Code Expand
def inpl(): return [int(i) for i in input().split()] N = int(input()) A = [0]+inpl()+[0] sumtr = 0 for i in range(N+1): sumtr += abs(A[i+1]-A[i]) for i in range(1,N+1): print(sumtr +abs(A[i+1]-A[i-1]) -abs(A[i]-A[i-1]) -abs(A[i+1]-A[i]))
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | kunito777 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 256 Byte |
Status | AC |
Exec Time | 233 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 | 218 ms | 13148 KB |
02.txt | AC | 216 ms | 13792 KB |
03.txt | AC | 18 ms | 3060 KB |
04.txt | AC | 230 ms | 14044 KB |
05.txt | AC | 224 ms | 14048 KB |
06.txt | AC | 214 ms | 14048 KB |
07.txt | AC | 226 ms | 14048 KB |
08.txt | AC | 233 ms | 14048 KB |
09.txt | AC | 211 ms | 11784 KB |
10.txt | AC | 217 ms | 11908 KB |
11.txt | AC | 217 ms | 11792 KB |
12.txt | AC | 222 ms | 11924 KB |
sample-01.txt | AC | 18 ms | 3060 KB |
sample-02.txt | AC | 18 ms | 2940 KB |
sample-03.txt | AC | 18 ms | 3060 KB |