Блог пользователя maroonrk

Автор maroonrk, история, 5 лет назад, По-английски

Hello, Codeforces!

I have news today: I joined the AtCoder team and started working as an admin. It does not mean I take rng_58's place right now. I'm just a beginner as an admin, so, for the time being, we will hold contests together, and I will learn how to do it.

For this year, I don't stop participating in all AtCoder contests(especially AGCs) and aim to get a ticket for the WTF2021. I will mainly supervise ARC-level contest (and Japanese local contests).

From next year, I'll start checking submitted problems from all writers and organize contests as main admin.

Tomorrow's ARC-level contest is the first contest coordinated by me (with the help of rng_58). I'm looking forward to your participation!

  • Проголосовать: нравится
  • +974
  • Проголосовать: не нравится

»
5 лет назад, # |
  Проголосовать: нравится +92 Проголосовать: не нравится

Good luck!

»
5 лет назад, # |
  Проголосовать: нравится +63 Проголосовать: не нравится

Hooray。 I can't wait for more data structure problems of yours!

»
5 лет назад, # |
  Проголосовать: нравится +15 Проголосовать: не нравится

Congratulations!

How do you think about data structure tasks in AGC? maroonrk

  • »
    »
    5 лет назад, # ^ |
    Rev. 2   Проголосовать: нравится +150 Проголосовать: не нравится

    I'm not yet determined but considering to introduce them. However, since it is not an opencup or IOI, I will never set heavy problems. Also, I don't like just-copy-paste or knowledge-oriented problems. (They are educational, but not suitable for rated contests.)

    So I'll provide the following types of data structure problems:

    • The data structure part is easy and common, and other parts are interesting enough. Actually, this point is not so different from rng_58's opinion, but my criteria for "easy and common" is just looser.

    • The data structure itself is interesting and not that hard to implement. The example problem of this type in my mind is this.

    I can rarely find problems of the second type, so the majority of data structure problems are of the first type, which means you might see more lazy segtrees but the problems of AGCs won't change drastically.

  • »
    »
    5 лет назад, # ^ |
      Проголосовать: нравится +162 Проголосовать: не нравится

    Go solve your stupid problems on chinese OJ and don't mess with the only place with brilliant problems