Oi, Codeforces!
We are excited to announce the University of São Paulo's Try-outs contest, which will take place on August 12 at UTC-3, São Paulo time. This contest aims to select the teams that will represent our university in the Brazilian regional. The official contest will be held locally at USP, but we are also running an online mirror contest simultaneously on Codeforces!
The link for the mirror in Codeforces: https://codeforces.net/contestInvitation/82981b01c515fb1be092bfd0aeca18ec067ceea9
Contestants should follow ICPC rules. We have prepared challenging and interesting problems suitable for both beginners and veterans. You can check previous contests to get an estimate of the difficulty level.
The authors of the contest are Gabriel morete Morete, Pedro pedroteosousa Sousa, Renzo renzo1805 Gómez, Thiago thilio Oliveira, Víctor VLamarca Lamarca and myself. We also like to thank Gustavo gustavo_m32 Carlos, Jiang kokosha Zhi and Lucas lucas3h Harada for their help preparing the contest.
Also, huge thanks to the testers for their time and valuable feedback:
Naims NaimSS Santos, Tiago tdas Domingos and Yan yan.silva Silva;
Emanuel emaneru Silva, Felipe fmota and Kaio MvKaio Vieira.
Some past editions of this competition are available at Codeforces Gym. The most recent are : 2022, 2021, 2019, 2018, 2017, 2016, 2015.
We will look forward your participation!
UPD: Editorial in English is now available in the contest materials.
Auto comment: topic has been updated by byakko (previous revision, new revision, compare).
orz byakko
Up! As an author I know the problems are high quality and fun
Thanks for the interesting problems!
Is there an editorial?
There will be an editorial soon.
The problems are fun!
Is the intended solution for F 3d Mo(Mo with updates)?
Also how to solve C and L?
I'm glad you liked them!
The intended solution for F is just segment tree (not a straightforward application tho).
Problem C can be solved with binary search and hashing (I thought that one would had more accepted solutions tbh).
And problem L is really hard. I don't think I'm able to explain it haha. However, an editorial with detailed solutions will be posted soon :3
Auto comment: topic has been updated by byakko (previous revision, new revision, compare).