language: Ocaml (ocamlopt 3.10.2)
date: 193 days 11 hours ago
link:
visibility: public 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
                                match compare (fst range) head, compare (snd range) head with
                                        | (0, 0), (0, 0) -> range::xs
                                        | (0, 0), (1, 1) -> impl range tail ret
                                        | (1, 1), (1, 1) -> impl range tail (head::ret)
                                        | (0, 0), (1, 0) -> impl ((fst range), (snd head)) tail ret
                                        | (1, 0), (1, 1) -> impl ((fst head), (snd range)) tail ret
                                        | _                              -> xs
        in impl range xs []
 
let main =
        let ret = [] in
        let num = Scanf.scanf "%d\n" (fun n -> n) in
        let input () = Scanf.scanf "%d %d\n" (fun h t -> (h, t)) in
        List.iter (fun r -> Printf.printf "%d %d\n" (fst r) (snd r)) (
                List.sort Pervasives.compare (
                        let rec loop n ret =
                                if n = 0 then ret else loop (n-1) (insert (input ()) ret)
                        in loop (num-1) (input () :: ret)))