Submission #2978623
Source Code Expand
module Q = Set.Make(struct type t = int * int let compare = compare end) let () = Scanf.scanf "%d %d" @@ fun n k -> let x = Array.init n (fun i -> Scanf.scanf " %d" (fun e -> i, e)) in Array.fold_left (fun q (i, e) -> let q' = Q.add (e, i+1) q in let q'' = if i >= k then Q.remove (Q.max_elt q') q' else q' in if i >= k-1 then Printf.printf "%d\n" (Q.max_elt q'' |> snd); q'' ) Q.empty x |> ignore
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | lrmystp |
Language | OCaml (4.02.3) |
Score | 100 |
Code Size | 431 Byte |
Status | AC |
Exec Time | 177 ms |
Memory | 18688 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 | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
subtask1_01.txt | AC | 1 ms | 384 KB |
subtask1_02.txt | AC | 1 ms | 384 KB |
subtask1_03.txt | AC | 1 ms | 384 KB |
subtask1_04.txt | AC | 1 ms | 512 KB |
subtask1_05.txt | AC | 2 ms | 1536 KB |
subtask1_06.txt | AC | 2 ms | 1152 KB |
subtask1_07.txt | AC | 2 ms | 1280 KB |
subtask1_08.txt | AC | 2 ms | 1536 KB |
subtask1_09.txt | AC | 2 ms | 1536 KB |
subtask1_10.txt | AC | 2 ms | 1536 KB |
subtask1_11.txt | AC | 2 ms | 1536 KB |
subtask2_01.txt | AC | 20 ms | 4352 KB |
subtask2_02.txt | AC | 3 ms | 2048 KB |
subtask2_03.txt | AC | 177 ms | 14208 KB |
subtask2_04.txt | AC | 61 ms | 6784 KB |
subtask2_05.txt | AC | 162 ms | 18688 KB |
subtask2_06.txt | AC | 139 ms | 9856 KB |
subtask2_07.txt | AC | 143 ms | 12800 KB |
subtask2_08.txt | AC | 130 ms | 9216 KB |
subtask2_09.txt | AC | 151 ms | 12928 KB |