Submission #3000247
Source Code Expand
let () = Scanf.scanf "%d %d" @@ fun n m -> let a = Array.init m (fun i -> Scanf.scanf " %d %d" (fun x y -> i+1, x, y)) in let c = Array.make (n+2) 0 in Array.iter (fun (_, s, t) -> c.(s) <- c.(s) + 1; c.(t+1) <- c.(t+1) - 1) a; for i = 1 to n do c.(i) <- c.(i) + c.(i-1) done; for i = 1 to n do c.(i) <- c.(i-1) + if c.(i) = 1 then 1 else 0 done; let b = Array.fold_left (fun ac (i, s, t) -> if c.(t) - c.(s-1) = 0 then i::ac else ac) [] a |> List.rev in Printf.printf "%d\n" (List.length b); List.iter (Printf.printf "%d\n") b
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | lrmystp |
Language | OCaml (4.02.3) |
Score | 100 |
Code Size | 556 Byte |
Status | AC |
Exec Time | 87 ms |
Memory | 14208 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | 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, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 384 KB |
subtask0_sample_02.txt | AC | 1 ms | 384 KB |
subtask0_sample_03.txt | AC | 1 ms | 384 KB |
subtask1_01.txt | AC | 58 ms | 9984 KB |
subtask1_02.txt | AC | 85 ms | 14208 KB |
subtask1_03.txt | AC | 55 ms | 8448 KB |
subtask1_04.txt | AC | 73 ms | 10752 KB |
subtask1_05.txt | AC | 76 ms | 10752 KB |
subtask1_06.txt | AC | 1 ms | 384 KB |
subtask1_07.txt | AC | 1 ms | 384 KB |
subtask1_08.txt | AC | 1 ms | 384 KB |
subtask1_09.txt | AC | 1 ms | 384 KB |
subtask2_01.txt | AC | 81 ms | 14208 KB |
subtask2_02.txt | AC | 86 ms | 14208 KB |
subtask2_03.txt | AC | 1 ms | 384 KB |
subtask2_04.txt | AC | 1 ms | 512 KB |
subtask2_05.txt | AC | 1 ms | 512 KB |
subtask2_06.txt | AC | 1 ms | 512 KB |
subtask2_07.txt | AC | 1 ms | 512 KB |
subtask2_08.txt | AC | 87 ms | 13184 KB |