Submission #3600664


Source Code Expand

n, k = map(int,input().split())
x = list(map(int,input().split()))
time = 10**8
for i in range(len(x) - k + 1):
    x_k = x[i:i+k]
    #print(x_k)
    if x_k[0] >= 0:
        time = min(x_k[-1], time)
            
    elif x_k[-1] <= 0:
        time = min(-x_k[0], time)

    elif -x_k[0] <= x_k[-1]:
        t = -x_k[0] * 2 + x_k[-1]
        time = min(t, time)
    else:
        t = -x_k[0] + x_k[-1] *2
        time = min(t, time)

print(time)

Submission Info

Submission Time
Task C - Candles
User mory
Language Python (3.4.3)
Score 0
Code Size 467 Byte
Status WA
Exec Time 2104 ms
Memory 14252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 6
WA × 1
TLE × 5
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 WA 43 ms 13984 KB
1_01.txt TLE 2104 ms 14172 KB
1_02.txt AC 42 ms 14252 KB
1_03.txt TLE 2104 ms 14100 KB
1_04.txt AC 42 ms 14004 KB
1_05.txt TLE 2104 ms 14000 KB
1_06.txt TLE 2104 ms 13944 KB
1_07.txt TLE 2104 ms 13976 KB