maroonrk's blog

AtCoder World Tour Finals 2022 Announcement (with Rated Mirrors)
By maroonrk, history, 16 months ago, In English

We will hold AtCoder World Tour Finals 2022.

List of Finalists:

AtCoder IDCodeforces IDAdvanced Years
touristtourist2019,2020,2021,2022
ksun48ksun482019,2021,2022
BenqBenq2020,2021
Um_nikUm_nik2019,2020
apiadjqdai08152019,2021,2022
StonefeangRadewoosh2020
ecnerwalaecnerwala2019,2020,2021
mnbvmarmnbvmar2019,2020
newbiedmyRewinding2021
jianglyjiangly2021
heno239heno2392021
LHiCLHiC2019
endagorionEndagorion2020
zhoukangyangorzdevinwang2022
PetrPetr2019,2020,2022
mulgokizarygamegame2022
Mr_EightMr_Eight2022
peti1234peti12342022

Day1

The point values will be 500-1000-1500-2000-2500

Day2

The point values will be 1000-1500-2000-2000-2500

AtCoder World Tour Finals 2022 is an international onsite contest. We have invited top-runners of AtCoder Race Ranking 2019-2022 to Tokyo. We will combine the results of the two contests to decide on the champion. The score of the participant is calculated as (score of Day1) + (score of Day2) + (the number of Advancements to Finals). The time penalties are also summed. You will see this combined score in the standings during the contest. Considering that the special rules will affect strategies of participants, the Finals itself is unrated. Note that, unlike other onsite competitions, there's no freeze in the contest.

Mirror contests don't have special rules, so they are just two independent rated contests. They happen at the same time as the Finals (=13:00 in UTC+9), so they are much earlier than usual AtCoder contests.

We are looking forward to your participation!

UPD

With the help from lperovskaya and ICPC streaming tools, we will stream the Finals in our YouTube channel. Since we have rated mirrors, there is no commentary and we will only show the contest venue, webcam videos of Finalists, and standings.

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

Comments Comments (26)
| Write comment?
»
16 months ago, # |
  Vote: I like it +397 Vote: I do not like it

17 Legends and me.

→ Reply
»
16 months ago, # |
  Vote: I like it +21 Vote: I do not like it

Wow, rng_58, hisashiburi! BTW, orz maroonrk for setting all the problems!

→ Reply
»
15 months ago, # |
← Rev. 2   Vote: I like it -40 Vote: I do not like it

I think it's totally unfair to add the number of attending the finals to the points. As we know, it's very hard for top players to solve even 1 or more problems than each other. So their rank depends usually on penalty. Rank should react player's real true level, but I don't think it will now. For example tourist can arbitrary submit solutions because he gets the most init points and he don't need to worry about the penalty. And also, it's unfair to new players like jiangly, who is still in college and don't have time to attend final than others already graduated.. So I suggest delete this rule. And do something else to reward these finalist. And for the finalist, I think they just want to have fun equally in contest.

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

Considering that the special rules will affect strategies of participants, the Finals itself is unrated.

But now the contest page is still showing

Rated Range: 2000 — inf

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it -36 Vote: I do not like it

    The final to 18 finalist is unrated because of the unfair init points I mentioned, but the open mirror contest is still rated as an agc-like contest.

    → Reply
»
15 months ago, # |
← Rev. 4   Vote: I like it +62 Vote: I do not like it

should've atleast mentioned that there will be a livestream :/ https://www.youtube.com/live/b55sFRsz3ow?si=uCQeQ2xCUMubmBSF

→ Reply
»
15 months ago, # |
  Vote: I like it +29 Vote: I do not like it

Alternative solution of B:

for each loop in the permutation, find the median number and divide the permutation into some (a[i]>median or a[i]<median) segments, then divide and conquer.

Kind of hard to implement but easy to find out :P

→ Reply
»
15 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Is the solution for B unique (if it is one big cycle)? I copied code from various submissions and ran on a few tests and it seems like the outputs are all the same.

→ Reply
  • »
    »
    15 months ago, # ^ |
    ← Rev. 2   Vote: I like it +32 Vote: I do not like it

    Don't these produce the same cycle?

    (2 3) -> (1 2) -> (3 4)
(2 3) -> (3 4) -> (1 2)
    → Reply
    • »
      »
      »
      15 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yes that was stupid I didn't think of that.

      Is it possible to find a counter case where the set of moves are different though? Or is the set of moves distinct?

      → Reply
»
15 months ago, # |
  Vote: I like it +24 Vote: I do not like it

Auto comment: topic has been updated by maroonrk (previous revision, new revision, compare).

→ Reply
»
15 months ago, # |
  Vote: I like it +56 Vote: I do not like it

Maybe the rated range should be 2800+ (xd

→ Reply
»
15 months ago, # |
  Vote: I like it +244 Vote: I do not like it

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

Quite fascinatingly, at the end, most of the positions in final standings are unaffected by the additional points given for number of times participants qualified. Except between Petr and Um_nik. And jqdai0815 who would be at position 11th instead of 8th according to time penalty if not for the 2 extra points he had. It would still likely have affected participants strategies in the contest.

→ Reply
  • »
    »
    15 months ago, # ^ |
      Vote: I like it +42 Vote: I do not like it

    It would still likely have affected participants strategies in the contest.

    tourist said as much during the award ceremony. He solved E halfway through day 2 but did not submit immediately because "there was no point"

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

Just curious, how hard to get into that room?

→ Reply