Submission #111782

---

Source Code Expand

let ( @@ ) f x = f x
let ( |> ) x f = f x
let id x = x
let curry f x y = f (x, y)
let flip f x y = f y x

let repeat f =
  let rec loop acc = function
    | 0 -> List.rev acc
    | n -> loop (f () :: acc) (n - 1) in
  loop []

let range start =
  let rec loop acc goal =
    if start > goal then acc
    else loop (goal :: acc) (goal - 1) in
  loop []

let (n, m) = Scanf.scanf "%d %d\n" @@ curry id
let inputs = repeat (fun () -> Scanf.scanf "%d %d\n" @@ curry id) m

let diets = range 1 n
let connections =
  List.flatten @@ List.map (fun (x, y) -> [(x, y); (y, x)]) @@ inputs

let rec pairs = function
  | [] -> []
  | x :: xs -> List.map (curry id x) xs @ pairs xs

let () = 
  List.fold_left (fun all x ->
    List.flatten @@ List.map (fun y -> [x :: y; y]) all) [[]] diets
  |> List.filter (fun subdiets ->
      pairs subdiets
      |> List.map (flip List.mem connections)
      |> List.fold_left ( && ) true)
  |> List.map List.length
  |> List.fold_left max 0
  |> Printf.printf "%d\n"

Submission Info

Judge Result