Submission #1499701
Source Code Expand
import std.stdio, std.string, std.array, std.conv, std.algorithm, std.typecons, std.range, std.container; struct AgId{ int age; ulong id; int opCmp(ref const AgId s) const { return age<s.age?-1:1; } } void main(){ auto nk=readln.chomp.split.map!(to!int).array; auto N=nk[0]; auto K=nk[1]; auto Xs=readln.chomp.split.map!(to!int).array; AgId[] agids; foreach(i,x;Xs)agids~=AgId(x,i+1uL); auto heap=new AgId[](Xs.length).heapify(0); foreach(i;0..K)heap.insert(agids[i]); writeln(heap.front.id); foreach(i;K..Xs.length){ heap.insert(agids[i]); heap.removeFront(); writeln(heap.front.id); } }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | faidra |
Language | D (DMD64 v2.070.1) |
Score | 100 |
Code Size | 711 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 9788 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 60 / 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 380 KB |
subtask1_06.txt | AC | 1 ms | 380 KB |
subtask1_07.txt | AC | 1 ms | 380 KB |
subtask1_08.txt | AC | 1 ms | 380 KB |
subtask1_09.txt | AC | 1 ms | 380 KB |
subtask1_10.txt | AC | 1 ms | 380 KB |
subtask1_11.txt | AC | 1 ms | 380 KB |
subtask2_01.txt | AC | 7 ms | 1276 KB |
subtask2_02.txt | AC | 2 ms | 380 KB |
subtask2_03.txt | AC | 40 ms | 9020 KB |
subtask2_04.txt | AC | 35 ms | 9532 KB |
subtask2_05.txt | AC | 24 ms | 9660 KB |
subtask2_06.txt | AC | 38 ms | 9660 KB |
subtask2_07.txt | AC | 35 ms | 9788 KB |
subtask2_08.txt | AC | 40 ms | 9148 KB |
subtask2_09.txt | AC | 36 ms | 9276 KB |