Submission #1453497

---

Source Code Expand

let rec fold_tournament dir f = function
  | [x] -> x
  | xs ->
      List.fold_left (fun (acc, prev) x ->
        match prev with
        | None -> (acc, Some x)
        | Some y -> ((if dir then f y x else f x y) :: acc, None)) ([], None) xs
      |> (function
          | (acc, None) -> acc
          | (acc, Some x) -> x :: acc)
      |> fold_tournament (not dir) f
let fold_tournament f xs = fold_tournament true f xs

let () =
  let k = Scanf.scanf "%d\n" (fun k -> k) in
  let rs = Array.to_list @@ Array.init (1 lsl k) (fun _ ->
    Scanf.scanf "%d\n" (fun r -> r)) in
  List.map (fun r -> [(r, 1.)]) rs
    |> fold_tournament (fun rps rps' ->
        List.concat @@ List.map (fun (rps, rps') ->
          List.map (fun (r, p) ->
            List.map (fun (r', p') ->
              p' /. (1. +. 10. ** (float_of_int (r' - r) /. 400.))) rps'
            |> List.fold_left ( +. ) 0.
            |> ( *. ) p
            |> (fun p -> (r, p))) rps) [(rps, rps'); (rps', rps)])
    |> List.map snd
    |> List.iter (Printf.printf "%.10f\n")

Submission Info

Judge Result