Submission #163174

---

Source Code Expand

let read_tbl () =
  ignore (read_line ());
  let flr t = if t mod 5 = 0 then t else t - (t mod 5) in
  let cil t = if t mod 5 = 0 then t else t + (5 - t mod 5) in
  let rec go acc =
    let cont sh sm eh em = go ((sh*60+sm, eh*60+em) :: acc) in
    try Scanf.scanf "%2d%2d-%2d%2d\n" cont with
    | End_of_file -> acc
  in
  List.rev_map (fun (s, e) -> (flr s, cil e)) (go [])

let prn (s, e) =
  Printf.printf "%02d%02d-%02d%02d\n" (s / 60) (s mod 60) (e / 60) (e mod 60)

let mrg ts (s1, e1) =
  match ts with
  | []             -> [(s1, e1)]
  | (s0, e0) :: ts ->
    assert (s0 <= s1);
    if e0 >= s1 then (s0, max e0 e1) :: ts
    else             (s1, e1) :: (s0, e0) :: ts

let () =
  let tbl = List.sort (fun (s0, _) (s1, _) -> compare s0 s1) (read_tbl ()) in
  List.iter prn (List.rev (List.fold_left mrg [] tbl))

Submission Info

Judge Result