Submission #3601123
Source Code Expand
from bisect import bisect_left N, K = map(int, input().split()) x = [int(s) for s in input().split()] izero = bisect_left(x, 0) zpos = x[izero:] neg = [-v for v in reversed(x[:izero])] ans = 1000000000 if len(neg) >= K and ans > neg[K - 1]: ans = neg[K - 1] if len(zpos) >= K and ans > zpos[K - 1]: ans = zpos[K - 1] for lenneg in range(max(1, K - len(zpos)), min(K - 1, len(neg))): cand = 2 * neg[lenneg - 1] + zpos[K - lenneg - 1] if ans > cand: ans = cand cand = neg[lenneg - 1] + 2 * zpos[K - lenneg - 1] if ans > cand: ans = cand print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Candles |
User | cexen |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 609 Byte |
Status | WA |
Exec Time | 85 ms |
Memory | 14480 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 20 ms | 3188 KB |
0_01.txt | AC | 18 ms | 3064 KB |
0_02.txt | AC | 18 ms | 3064 KB |
0_03.txt | AC | 18 ms | 3064 KB |
1_00.txt | WA | 51 ms | 13988 KB |
1_01.txt | AC | 85 ms | 13988 KB |
1_02.txt | AC | 53 ms | 14480 KB |
1_03.txt | AC | 54 ms | 14100 KB |
1_04.txt | AC | 48 ms | 14132 KB |
1_05.txt | AC | 48 ms | 14132 KB |
1_06.txt | AC | 73 ms | 14068 KB |
1_07.txt | AC | 77 ms | 13976 KB |