Hi!
Hints
A: Tag: Greedy!
B: Tag: Greedy!
C: For each vertex like v find exv, the expected length of their journey if they start from v.
D: Tag: Inclusion exclusion.
E: Find the maximum clique.
Solutions
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
NikaraBika's solution: 29458745.
Tutorial is loading...
P.S. Please notify me if there is any problem.