Hello!
XXII Open Cup. Grand Prix of Daejeon will be held in 2022/03/27 Sunday, 17:00 KST (UTC+9). The date of March 27 is final.
Daejeon is home to KAIST, but the contest itself has little to do with it, it just inherits the spirit of 2019 Daejeon GP.
The contest was used as a Day 2 Contest for Petrozavodsk Winter Camp 2022. I'm sorry for the camp participants over the lack of editorial. I will work to publish the full editorials right after the GP.
Problems were authored by ko_osaga, GyojunYoun, tamref, Diuven, queued_q, jh05013. Special thanks to xiaowuc1 for reviewing the statements.
For external accounts, the contest is ready now.
Note that the old opencup.ru link is not accessible now. (snarknews is trying to find servers outside of Russia.)
List of relevant previous contests:
- XVIII Open Cup. GP of Korea
- KAIST RUN Spring Contest 2018
- XIX Open Cup. GP of Korea
- XIX Open Cup. GP of Daejeon
- XX Open Cup. GP of Korea
- 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest
- XXI Open Cup. GP of Korea
- XXI Open Cup. GP of Suwon
- XXII Open Cup. GP of Korea
Enjoy!
As a camp participant, I really love this contest. It's my favourite contest in the Winter Petrozavodsk Camp.
And the most amazing part for a Korean Grand Prix is the data structure problems XD.
Agree! I found those problems really interesting even I tended to dislike a round with many data structure problems.
Auto comment: topic has been updated by ko_osaga (previous revision, new revision, compare).
Due to the Russian invasion of Ukraine, the contest is postponed for a week.
If the Opencup round really is tomorrow, it seems it conflicts with the Codeforces div. 1 round. Is this really the case?
Snark has just post an announcement on the telegram channel:
(https://t.me/opencup_ru/66)
Auto comment: topic has been updated by ko_osaga (previous revision, new revision, compare).
Seems the contest has (finally) been finished.
What's the idea behind problem G? Is it related to some new techniques?
Following the general recipes for 3-connectivity may help, but I feel that they are just thinkable with your bare hands.
ecnerwala upsolved the problem with SPQR-tree. Maybe we can make some interesting discussions out of it.
Yeah, there recently have been a ton of problems which can be killed by generic triconnectivity/SPQR:
You can take a look at my submission to problem 1656I to see my current template. I'm still working on improving the interface, but it is complete and linear time. I might write up a tutorial on it, but that will take some time.
Thank you for the participation. Editorials are here. Gym contests will be configured shortly.
Authors:
and kudos for MIT_Copypaste who prevented D to survive through Prime Contest. (Big surprise for me!)
Gym (Ghosts are unavailable due to the closing of opencup.ru)
Gym's built-in parser works well for the Yandex.Contest standings page... Maybe you can add ghosts by parsing the standings page directly.
Hmm... which things should I copy-paste? I tried several stuffs but none of them worked
Just copy the whole table in HTML to the parser. I have set it up by using the built-in parser and the standings data from Yandex.Contest.
I really don't get it. If I download the HTML of standing page, I receive a 1MB-size text. Sorry, I'm bad at machines...
EDIT: Ok you have set it up already, thank you XD
Is problem J just intended to be a massive augmented top tree? I have a top tree with a dozen different pieces of augmenting information and a 120 line update() function.
Unfortunately yes. However Marcin_smu upsolved it with link cut tree (it was not easier, but we don't have top trees)
I already nominate K (Fake Plastic Trees 2) as the best problem of the year