Submission #4050288

Source Code Expand

N = int(input())
A = []
A.append(0)
B = [int(i) for i in input().split()]
A.extend(B)
A.append(0)

s = sum([abs(A[i]-A[i+1]) for i in range(N+1)])

for i in range(1,N+1):
    print(s-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1]))

Submission Info

Submission Time
Task C - Traveling Plan
User sakusaku858
Language Python (3.4.3)
Score 300
Code Size 246 Byte
Status AC
Exec Time 216 ms
Memory 15840 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 15
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 13792 KB
02.txt AC 203 ms 13792 KB
03.txt AC 17 ms 3060 KB
04.txt AC 211 ms 14044 KB
05.txt AC 212 ms 13792 KB
06.txt AC 216 ms 15840 KB
07.txt AC 207 ms 13792 KB
08.txt AC 207 ms 14048 KB
09.txt AC 197 ms 11784 KB
10.txt AC 193 ms 11908 KB
11.txt AC 187 ms 11784 KB
12.txt AC 195 ms 11924 KB
sample-01.txt AC 17 ms 2940 KB
sample-02.txt AC 17 ms 3064 KB
sample-03.txt AC 17 ms 3064 KB