ko_osaga's blog

IOI 2024
By ko_osaga, history, 5 hours ago, In English

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.

  • Vote: I like it
  • +57
  • Vote: I do not like it

»
5 hours ago, # |
  Vote: I like it +10 Vote: I do not like it

Why "Please" twice what happened

→ Reply
»
5 hours ago, # |
← Rev. 3   Vote: I like it +2 Vote: I do not like it

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.

→ Reply
»
5 hours ago, # |
  Vote: I like it +3 Vote: I do not like it

However,I think orzdevinwang will AK IOI!!!

→ Reply
»
4 hours ago, # |
  Vote: I like it +3 Vote: I do not like it

hi! I can't see you but I want to, where are you/what are you planning to do today?

→ Reply
  • »
    »
    4 hours ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    I'll be in the translation session, so not much window today. I'm likely around in the closing ceremony.

    → Reply
»
3 hours ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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.

→ Reply
»
3 hours ago, # |
  Vote: I like it +9 Vote: I do not like it

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.

→ Reply
  • »
    »
    2 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    In the last iteration of the loop at line 42 in tree, UB is invoked as W[W.size()] is accessed.

    → Reply
  • »
    »
    98 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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)

    → Reply
    • »
      »
      »
      83 minutes ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      The other solutions involve segment tree or set or similar stuff the require more case work than DSU.

      → Reply