Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
21.12
module FU : sig type 'a set val make_set : ’a -> ’a set val find : ’a set -> ’a val equivalent : ’a set -> ’a set -> bool val union : ’a set -> ’a set -> unit val elements : ’a set -> ’a list val n_of_sets : unit -> int end;; let malpki (trzyma : (int*int) array) (puszcza : (int*bool) list) = let n = Array.length trzyma in let grupa = Array.init n (fun i -> make_set i) in let wynik = Array.make n 0 in let rec wydarzenia lst moment = match lst with | [] -> () | h::t -> let malpka_1, malpka_2 = if snd h then fst h, snd trzyma.(fst h) else fst h, fst trzyma.(fst h) in if (not (FU.union grupa.(malpka_1) grupa.(malpka_2); if equivalent malpka_2 1 then List.iter (fun i -> wynik.(i) <- moment) (elements malpka_2) if equivalent malpka_1 1 then List.iter (fun i -> wynik.(i) <- moment) (elements malpka_1) wydarzenia t (moment - 1) in wydarzenia (List.rev puszcza) n; wynik;; (* FU.union grupa.(i) grupa.(j) *)
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Ocaml sort
zachlanne
Please log in to post a comment.