Submission #5073588


Source Code Expand

n = int(input())
a = [0]
a.extend([int(i) for i in input().split()])
a.append(0)
b = [0]*(n+2)
for i in range(n+1):
    b[i+1] = b[i] + abs(a[i+1] - a[i])
for i in range(n):
    ans = b[-1] + abs(a[i+2] - a[i]) - abs(a[i+1]-a[i]) - abs(a[i+2]-a[i+1])
    print(ans)

Submission Info

Submission Time
Task C - Traveling Plan
User gekko
Language Python (3.4.3)
Score 300
Code Size 274 Byte
Status AC
Exec Time 242 ms
Memory 14048 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 231 ms 13788 KB
02.txt AC 231 ms 14040 KB
03.txt AC 17 ms 3064 KB
04.txt AC 237 ms 13792 KB
05.txt AC 242 ms 14048 KB
06.txt AC 232 ms 13792 KB
07.txt AC 232 ms 14048 KB
08.txt AC 236 ms 14048 KB
09.txt AC 226 ms 11792 KB
10.txt AC 228 ms 11908 KB
11.txt AC 233 ms 11792 KB
12.txt AC 224 ms 11924 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