Submission #3215157
Source Code Expand
N = int(input()) A = list(map(int,input().split())) L = [] A.insert(0,0) A.insert(N+1,0) for i in range(1,N+1): k = 0 L.append(A[i]) del (A[i]) for j in range(N): k += abs(A[j]-A[j+1]) A.insert(i,L[i-1]) print(k)
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | Syuko4omi |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 240 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 13920 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | TLE | 2104 ms | 13788 KB |
02.txt | TLE | 2104 ms | 13784 KB |
03.txt | AC | 17 ms | 3060 KB |
04.txt | TLE | 2104 ms | 13792 KB |
05.txt | TLE | 2104 ms | 13920 KB |
06.txt | TLE | 2104 ms | 13792 KB |
07.txt | TLE | 2104 ms | 13920 KB |
08.txt | TLE | 2104 ms | 13792 KB |
09.txt | TLE | 2104 ms | 11784 KB |
10.txt | TLE | 2104 ms | 12284 KB |
11.txt | TLE | 2104 ms | 11784 KB |
12.txt | TLE | 2104 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 | 3060 KB |