Hello! I'm happy to announce XXII Open Cup: Grand Prix of ByteDance, which will be held on July 24th, 2022.
This contest is first used in ByteDance Programming Camp 2022 on July 15th as the Final contest. It is organized by me, and prepared by 14 experienced problem setters who set at least 22 EC ICPC contests and 10 CCPC contests over the past 7 years. We believe this contest is both challenging, fun and might even be educational for teams.
Here representing the whole contest setting committee, I want to express our gratefulness to ByteDance for organizing this great camp and sponsor this contest, Oleg Hristenko for providing technical support, and our testing team (mayaohua2003, gtrhetr, 142857) and our coaches (jqdai0815, jiry_2, Claris, Gromah) for their help.
Problem Setters: quailty, Claris, Gromah, nothing100, Tommyr7, UESTC_Nocturne, shb123, oipotato, xyz2606, chenjb, Orenji.Sora, TsReaper, jiangshibiao, skywalkert.
Contest Link (Div.1): Yandex
UPD:
The contest is over now and please feel free to discuss.
Official Editorial: Dropbox
The contest will be uploaded onto Gym in the future.
Auto comment: topic has been updated by chenjb (previous revision, new revision, compare).
Auto comment: topic has been updated by chenjb (previous revision, new revision, compare).
Thank you for the interesting contest! How to solve L and N as well from Div 2 ? Actually, L is an easy problem, but it wasn't clear about the ace card in the statement. And also, it isn't clear in N, can we have double points for C and D?
Sorry we only set the div.1 contest and doesn’t know the detail of the div.2. So you might need to contact the OpenCup admin for further information.
The round is not as good as last one. Many problems are difficult to implement and the idea is not so interesting.. But B,H is very nice, anyway thank the authors.
Are you referring to div.1 or div.2 contest?
div.1 certainly
Is it possible to somehow squeeze kuhn like algorithm in C? I tried really hard, but with no luck..
I tried storing some value $$$best_v$$$ for each left node $$$v$$$, which is how much can we increase our matching if we start augmenting from $$$v$$$, however this value can't be calculated exactly and efficiently, so my solution sometimes calculated it incorrectly (when dfs visited same node twice). Eventually I get wa 76 and can't pass that.