ACM-ICPC 2018-19 Seoul Regionals Problem Hints

Revision en1, by LOLBYECYALOL, 2019-01-26 08:27:42

Link to Gym Contest [](https://codeforces.me/gym/101987)

Problem K: We had some ideas to model this problem as a graph problem and have edges between people (modeled as nodes) if they had conflicts. This approach is probably incorrect and I don't really have ideas, so help would be appreciated.

Problem G: Given that the agents arrived in order a, b, c, the probability of success should be P(t_b — t_a < w_a) * P(t_c — t_b < w_b) = w_a * w_b / S^2. Then we considered all permutations, which should give a probability of success of (w_a * w_b + w_a * w_c + w_b * w_c) / (3 * S^3). But this gave WA on Test 6. Any insights?

Thank you!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English LOLBYECYALOL 2019-01-26 08:27:42 749 Initial revision (published)