We will hold AtCoder World Tour Finals 2022.
List of Finalists:
| AtCoder ID | Codeforces ID | Advanced Years |
| tourist | tourist | 2019,2020,2021,2022 |
| ksun48 | ksun48 | 2019,2021,2022 |
| Benq | Benq | 2020,2021 |
| Um_nik | Um_nik | 2019,2020 |
| apiad | jqdai0815 | 2019,2021,2022 |
| Stonefeang | Radewoosh | 2020 |
| ecnerwala | ecnerwala | 2019,2020,2021 |
| mnbvmar | mnbvmar | 2019,2020 |
| newbiedmy | Rewinding | 2021 |
| jiangly | jiangly | 2021 |
| heno239 | heno239 | 2021 |
| LHiC | LHiC | 2019 |
| endagorion | Endagorion | 2020 |
| zhoukangyang | orzdevinwang | 2022 |
| Petr | Petr | 2019,2020,2022 |
| mulgokizary | gamegame | 2022 |
| Mr_Eight | Mr_Eight | 2022 |
| peti1234 | peti1234 | 2022 |
Day1
- Contest URL: https://atcoder.jp/contests/wtf22-day1
- Mirror Contest URL: https://atcoder.jp/contests/wtf22-day1-open
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20230908T1300&p1=248
- Duration: 300 minutes
- Number of Tasks: 5
- Writer: maroonrk
- Tester: maspy, HIR180, satashun, rng_58, yutaka1999
- Rated range: 2000 -
The point values will be 500-1000-1500-2000-2500
Day2
- Contest URL: https://atcoder.jp/contests/wtf22-day2
- Mirror Contest URL: https://atcoder.jp/contests/wtf22-day2-open
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20230909T1300&p1=248
- Duration: 300 minutes
- Number of Tasks: 5
- Writer: maroonrk
- Tester: maspy, HIR180, satashun, rng_58, yutaka1999
- Rated range: 2000 -
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.
17 Legends and me.
You are a legend for qualifying there.
so.....18 legends?
rk.7 on first day's contest.Congratulations and carry on!
Wow, rng_58, hisashiburi! BTW, orz maroonrk for setting all the problems!
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.
I find the rule weird and unfair as well. Idk why is this downvoted so much.
However, this does not affect jiangly's first place.
But now the contest page is still showing
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.
I just meant the Finals NOT THE MIRROR.
Sorry I'm wrong (T ^ T)
should've atleast mentioned that there will be a livestream :/ https://www.youtube.com/live/b55sFRsz3ow?si=uCQeQ2xCUMubmBSF
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
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.
Don't these produce the same cycle?
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?
Nice thanks!
Auto comment: topic has been updated by maroonrk (previous revision, new revision, compare).
Maybe the rated range should be 2800+ (xd
he is chokudai
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.
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"
Just curious, how hard to get into that room?