Hello! I created a round in ICPC style. It will be held in a private group (link), and it will start at 26/09 14:30 UTC-3 (17:30 UTC). It will last for 4 hours, and you will be given from 9 to 10 problems. I recommend this round for division 2 participants (you are still allowed to participate if you are not a div.2 participant). All the problems are authored by me.
You can participate with a team or individually.
- Thanks for ronak037, Dogelina, manpreet.singh, BohdanPastuschak, Mucosolvan, BlueDiamond, ajit, madlogic, Satwik_Tiwari, aayushabhyarthi and andr0901 for testing the round and providing valuable feedback.
- Thanks for andremfq for introducing me into CP and Codeforces.
- Thanks for MikeMirzayanov for Codeforces and Polygon plataforms. I didn't realize how great Polygon was untill I started using it.
Good luck, and have fun!
Note: To register the round, you need to join the group first. You need to register the group as a participant and not as an spectator to join the round.
UPD: To avoid problems in registering the contest, all group members are now in participant mode (except for the testers). You can roll back this action by your own. Note that if you don't submit or register for the contest your name won't appear in the leaderboard.
UPD: Registrations are open.
UPD: Contest has ended, congratulations to the winners!
The Andrades: Policarpo, valkyrja, MarquesLua
UPD: Editorial
Can you estimate the difficulty of the problems?
Can a noob like me try them out?
Easy problems will be Div. 2 B
I encourage you to participate. Testers feedback will appear soon!
Yes, beginners will definitely enjoy the round
I was looking at the group members, and many of them were spectators. I don't know if they selected this mode intentionally or unintentionally. You can't join the round in spectator mode, so if you selected the wrong mode, please change it.
As a tester, I encourage you to participate. The problems are very very nice!
As a tester I enjoyed the problemset..
Nice problemset! How to solve F?
I'm sorry for unclear statement in problem F. The intended solution was binary search on answer, testing for each time $$$t$$$ if cars get ordered (car $$$i$$$ will be at $$$i + tv_i$$$ after $$$t$$$ seconds)
why no editorial ??
Editorial will be published soon, it is not finished yet.
that will be nice :)
Editorial is published!
thanks