Hello, Codeforces.
The XIII BSUIR Open Programming Championship will be held from March 17 to May 3, 2025 (Minsk, Belarus).
Registration is already open and available until March 20 (inclusive). Teams consisting of 3 students from one higher educational institution, as well as school teams from different educational institutions are allowed to participate. Registration is made by the team captain on the website acm.bsuir.by.
The competition will be held in several stages:
- March 17 — 24 — Qualifying round (in absentia, mandatory for schoolchildren and students of BSUIR)
- April 9, 14:00-19:00 — Semi-final (in person, at sites organized by educational institutions)
- April 26 — Student final (in person, Minsk, BSUIR, Building 4, 9 Gikalo Street)
- May 3 — School final (in person, Minsk, BSUIR, Building 4, 9 Gikalo Street)
More information about the upcoming Olympiad and registration can be found on the website acm.bsuir.by.
Some previous videos:
How to register $$$??$$$
https://acm.bsuir.by/team/create
(you should sing up before this)
how to sing :(
With mouth :)
when will the qualifying round start $$$??$$$
March 17 — 24 — Qualifying round (in absentia, mandatory for schoolchildren and students of BSUIR)
no virtual participation, right?
We plan to hold a div1 round for each of the finals
I hope it goes well.
Will there be editorial for the qualifiers?
In particular, how to solve F, H, and I?
Solution draft for H: Let's iterate over how many merges we'll do for each type of token. Great, now let's check for each such set of merges whether it can be achieved and what the answer will be — we can do this greedily — we choose a pair with the maximum rank for which merges have not yet ended and merge. Thus, we get a solution that in the worst case works for: $$$O((k/5)^5*k)$$$.
Task I just requires a multi-sorce bfs. You have to solve the problem from the end. How to solve problem M?