提出 #4113005

---

ソースコード 拡げる

Scanf.(Array.(scanf " %d %d" @@ fun n m ->
  let e = make n [] in
  let e_rev = make n [] in
  init (n-1+m) (fun i -> scanf " %d %d" @@ fun u v ->
    let u,v = u-1,v-1 in
    e.(u) <- v :: e.(u);
    e_rev.(v) <- u :: e_rev.(v)
  ) |> ignore;
  let root = fst @@ fold_left (fun (root,i) ls ->
    (if List.length ls = 0 then i else root),i+1
  ) (0,0) e_rev in
  let topological_sort root =
    let state = make n `Todo in
    let res = ref [] in
    let rec visit i = match state.(i) with
    | `Done -> true
    | `Temp -> false (* cycle detected *)
    | `Todo -> (
      state.(i) <- `Temp;
      let f =
        List.fold_left (fun u j ->
          u && visit j
        ) true e.(i)
      in
      state.(i) <- `Done;
      res := i :: !res; f
    ) in
    assert (visit root); !res
  in
  let tp = topological_sort root in
  let mx = make n 0 in
  let res = make n 0 in
  List.iter (fun v ->
    List.iter (fun w ->
      if mx.(w) < mx.(v) + 1 then (
        mx.(w) <- mx.(v) + 1;
        res.(w) <- v + 1
      )
    ) e.(v)
  ) tp;
  res.(root) <- 0;
  iter (Printf.printf "%d ") res
))

提出情報

ジャッジ結果