Submission #3600893
Source Code Expand
n, k = map(int,input().split()) x = list(map(int,input().split())) time = 10**9 x_k = [0, 0] for i in range(n - k + 1): x_k[0] = x[i] x_k[1] = x[i+k-1] #print(x_k) if x_k[0] >= 0: t = x_k[1] elif x_k[1] <= 0: t = -x_k[0] else: t = min(-x_k[0] + x_k[1] *2,-x_k[0] * 2 + x_k[1]) time = min(t, time) print(time)
Submission Info
Submission Time | |
---|---|
Task | C - Candles |
User | mory |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 415 Byte |
Status | AC |
Exec Time | 97 ms |
Memory | 14224 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 17 ms | 3064 KB |
0_01.txt | AC | 17 ms | 3064 KB |
0_02.txt | AC | 17 ms | 3064 KB |
0_03.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 42 ms | 14172 KB |
1_01.txt | AC | 97 ms | 13984 KB |
1_02.txt | AC | 43 ms | 14224 KB |
1_03.txt | AC | 76 ms | 14224 KB |
1_04.txt | AC | 42 ms | 14092 KB |
1_05.txt | AC | 70 ms | 14092 KB |
1_06.txt | AC | 81 ms | 13944 KB |
1_07.txt | AC | 80 ms | 13976 KB |