Hello Codeforces! The 14th Stage of the 1st Universal Cup is coming. It will be held from Apr 29th to 30th.
The contest was used in the Osijek Competitive Programming Camp 2023 Winter. If you have solved any problems from the last day of the camp, please skip this round. Teams that participated in the camp can have their camp results included in the final standings.
All problems are authored and prepared by me.
I want to thank
- all testers for greatly improving the quality of the contest: edenooo brunovsky -is-this-fft- ainta nweeks fishy15 GeothermalOrz nmnsharma007 tamref,
- Osijek Camp organizers for hosting such an amazing camp, and
- Universal Cup committee for providing the opportunity to share this contest with a wider audience.
As usual, we have three time windows for participating. You can participate in the contest in the following three time windows:
- Apr 29th 13:00 — 18:00 (UTC +8)
- Apr 29th 19:00 — 24:00 (UTC +8)
- Apr 30th 02:00 — 07:00 (UTC +8)
Please note that you can see two scoreboards in DOMjudge. The 'Local Scoreboard' shows the standings ONLY IN THE CURRENT TIME WINDOW. And the 'Combined Scoreboard' shows all participants, including the onsite participants, and the cup participants in the previous time windows.
Contest link: https://domjudge.qoj.ac/
Universal Cup Scoreboard: https://qoj.ac/ucup/scoreboard
About Universal Cup:
Universal Cup is a non-profit organization dedicated to providing trainings for competitive programming teams. Up to now, there are more than 500 teams from all over the world registering for Universal Cup.
A more detailed introduction: https://codeforces.com/blog/entry/111672
Register a new team: https://ucup.ac/register (the registration request will be processed before each stage)
Results of the past stages: https://ucup.ac/results
As a tester-who-did-not-test-anything, I heard that Um_nik rejected some problems so Snow-Flower will use it in local contests which I might participate.
I am genuinely scared.
Osijek organizers did. Um_nik only called the contest shit ;)
IIRC, not all the Osijek organizers were opposed to the previous version of this contest. Speaking of non-organizers, I liked it a lot though, and it was quite a refreshing change of pace from usual ICPC contests. The changed problemset was good too.
You might actually like that shit.
As an Osijek participant, I liked the contest very much. But it's not your typical contest
For problem H, the augmented tree in the third phase has at most $$$9$$$ non-leaf vertices if my calculation is right. Brute force to decide whether to add them or not in the independent set, and do DP on $$$tw(G) \le 3 + 1$$$. This will simplify implementation.
Btw in Ptz-Winter 2023 there was my problem about finding width-3 decomposition for Halin Graph $$$G$$$. I added it to make the contest easier, but the scoreboard says no
How to solve F? The solution is difficult to understand.
Problem statement shit.