Submission #1671437
Source Code Expand
def main(): n,k = LI() a = LI() b = [(a[i],i+1) for i in range(n)] ra = sorted(b) ii = [None] * (n+1) for i in range(n): ii[ra[i][1]] = i ti = k-1 r = [ra[ti][1]] for i in range(n-1,k-1,-1): c = b[i][1] if ii[c] <= ti: ti += 1 while ra[ti][1] > c: ti += 1 r.append(ra[ti][1]) return '\n'.join(map(str, r[::-1])) print(main())
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | yuhi87star |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 464 Byte |
Status | RE |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 40 | 0 / 60 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt |
Subtask2 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | RE | 18 ms | 3064 KB |
sample_02.txt | RE | 18 ms | 3064 KB |
subtask1_01.txt | RE | 18 ms | 3064 KB |
subtask1_02.txt | RE | 18 ms | 3064 KB |
subtask1_03.txt | RE | 18 ms | 3064 KB |
subtask1_04.txt | RE | 18 ms | 3064 KB |
subtask1_05.txt | RE | 18 ms | 3064 KB |
subtask1_06.txt | RE | 18 ms | 3064 KB |
subtask1_07.txt | RE | 18 ms | 3064 KB |
subtask1_08.txt | RE | 18 ms | 3064 KB |
subtask1_09.txt | RE | 18 ms | 3064 KB |
subtask1_10.txt | RE | 18 ms | 3064 KB |
subtask1_11.txt | RE | 18 ms | 3064 KB |
subtask2_01.txt | RE | 18 ms | 3064 KB |
subtask2_02.txt | RE | 18 ms | 3064 KB |
subtask2_03.txt | RE | 17 ms | 3064 KB |
subtask2_04.txt | RE | 17 ms | 3064 KB |
subtask2_05.txt | RE | 17 ms | 3064 KB |
subtask2_06.txt | RE | 17 ms | 3064 KB |
subtask2_07.txt | RE | 17 ms | 3064 KB |
subtask2_08.txt | RE | 17 ms | 3064 KB |
subtask2_09.txt | RE | 17 ms | 3064 KB |