F - Lost Root CodeForces - 1061F(交互+概率)

Lost Root time limit per test 3 seconds memory limit per test 256 megabytes Problem Description The graph is called tree if it is connected and has no cycles. Suppose the tree is rooted at some vertex

>>阅读原文<<