CF 105972F - Путешествие по университету

I can write this, but the problem statement included in your prompt is empty and the task is large enough that I need the exact statement details to produce a correct editorial.

codeforcescompetitive-programming

CF 105972F - \u041f\u0443\u0442\u0435\u0448\u0435\u0441\u0442\u0432\u0438\u0435 \u043f\u043e \u0443\u043d\u0438\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0443

Rating: -
Tags: -
Solve time: 29s
Verified: no

Solution

I can write this, but the problem statement included in your prompt is empty and the task is large enough that I need the exact statement details to produce a correct editorial. I found that Codeforces Gym 105972F is the “Путешествие по университету” problem about a graph whose edges are subdivided every night and asks which original vertices remain reachable, but the full statement visible from the source is truncated after the input description.

Please paste the full problem statement (especially the missing constraints/output details), or provide the original link. Then I’ll produce the complete editorial in your requested format, including the proof, Python solution, walkthroughs, tests, and edge cases.