We will hold UOJ Easy Round #12 contest! You will be given 3 problems to be solved in 3 hours.
Recently, Flea Kingdom has been attempting to build a smart power grid for their nation. Can you help Volt accomplish the task of constructing the power grid?
- Contest link: https://uoj.ac/contest/95
- Start Time: https://www.timeanddate.com/worldclock/fixedtime.html?iso=20250316T1900&p1=33&ah=3
- Writers: Gellyfish, Crysfly, Kubic
- Duration: 3 hours
- Difficulty: CF Div.1.5 / ARC
- The point values: 100-100-100
The contest will follow the Pretest rules: During contest, every submission will only be judged on the pretests (in the problem attachments). All submissions will be rejudged on the final tests after contest. All the problems will have subtasks, the final score will be based on the last submission.
The contest is rated for everyone, you will be count as rated only if you opened at least one problem.
We are looking forward to your participation!
UPD: Congratulation to the winners!
will the problem statements be in english?
There will be brief English statements.
great! thank you
I would be very grateful, if rust would be added for future rounds
how does the rating system of uoj.ac work?
I don't know the details actually XD. But there's a plugin UOJ-Predictor.
doesn't open :(
How to solve p1?
If there exists maxdep >= k, consider the component formed by the k-th ancestors of all nodes. The answer is: 2*(n-1)-maxdep-(maxdep-k).
Otherwise, the two people can move to two leaves within some subtree, reducing the distance by min(diameter,k). The answer is: 2*(n-1)-min(diameter,k).
what's a virtual tree? i didn't understand much :(((
Please can you explain it more...
Auto comment: topic has been updated by Crysfly (previous revision, new revision, compare).
where to find the editorial for the problems ?
We will post the editorial a bit later.