IOI 2024 is held in Alexandria, Egypt. Good luck to all participants! I'm also attending as a student coach (Guest) as well; please say hi if you see me!
All times are in UTC+3 (Egypt — Eastern European Summer Time).
- Day 1: 2024.09.03 09:00 — 14:00
- Day 2: 2024.09.05 09:00 — 14:00
- Closing Ceremony: 2024.09.06 19:00 — 21:00
Links
Please, keep all discussions civil and according to the IOI Code of Conduct. Please.
Why "Please" twice what happened
On the Codeforces mirror, how does the submission for problem B work?
UDP: Nevermind, I figured it out. Just implement the functions in the problem statement.
However,I think orzdevinwang will AK IOI!!!
hi! I can't see you but I want to, where are you/what are you planning to do today?
I'll be in the translation session, so not much window today. I'm likely around in the closing ceremony.
There is no problem statement for any of the problems at ioi.codeforces.com IOI 2024 day 1 (the link above), I only see the input and output.
Here are the 100-point codes for all Day 1 problems — I wrote them while waiting for the bus to AASTMT :)
Shoutout to dillon0108 for sharing his beautiful solution of Message. Absolute legend.
In the last iteration of the loop at line 42 in tree, UB is invoked as W[W.size()] is accessed.
Fixed, thanks!
Are there any "easy" solution for Niles? I can't find an approach to it that isn't related to DSU (and requires some mild-heavy casework)
The other solutions involve segment tree or set or similar stuff the require more case work than DSU.