專題文章
時長:00:00更新時間:2020-11-09 08:02:36
codeforcesRound#241(div2)E解題報告:E. President's Path time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Good old Berland has n cities and m roads. Each road connects a pair of distinct cities and is bidirectional.
查看詳情