Submission #109294

---

Source Code Expand

let ( |> ) x f = f x

let inputs =
  let rec loop acc = function
    | 0 -> acc
    | n ->
        loop (Scanf.scanf "%u-%u\n" (fun n m -> (n, m) :: acc)) (n - 1) in
  loop [] (Scanf.scanf "%d\n" (fun n -> n))

let minutes_of_inputs n = (n / 100) * 60 + n mod 100
let inputs_of_minutes n = (n / 60) * 100 + n mod 60

let rec unify acc = function
  | [] -> acc
  | [range] -> unify (range :: acc) []
  | (start, goal) :: (start', goal') :: rest ->
      if goal >= start' then
        unify acc ((start, max goal goal') :: rest)
      else
        unify ((start, goal) :: acc) ((start', goal') :: rest)
let unify = unify []

let ceil n = n - n mod 5

let () =
  inputs
  |> List.map (fun (n, m) -> (minutes_of_inputs n, minutes_of_inputs m))
  |> List.map (fun (n, m) -> (ceil n, ceil (m + 4)))
  |> List.sort compare
  |> unify
  |> List.rev
  |> List.map (fun (n, m) -> (inputs_of_minutes n, inputs_of_minutes m))
  |> List.iter (fun (n, m) -> Printf.printf "%04d-%04d\n" n m)

Submission Info

Judge Result