Hello everyone!
We are back!
Due to the ongoing war in Iran, we had to postpone Repovive Standard Round 2.
While the situation prevented us from hosting the contest on time, we used this period to fix several technical issues and improve the platform.
We are now ready to host Repovive Standard Round 2. We hope you enjoy it!
- Start Time: Sunday, 19 April 2026, 13:35 (UTC) (Note the unusual starting time)
- Duration: 2 hours
- Registration: https://repovive.com/contests/5
The contest is rated for everyone.
- Writers: AmShZ and Hamed_Ghaffari
- Testers: Amoo_Safar, Ali_BBN and Shayan
See you on the leaderboard!
UPD1: Fortunately, the contest went smoothly without any issues. You can view the solutions in the Learn tab.
Congratulations to the top participants:
- 1: jeroenodb
- 2: HIR180
- 3: zaahir
- 4: RockyYue
- 5: 300iq
- 6: turneja
- 7: amirhoseinfar1385
- 8: anirudhc69
- 9: Мурадис
- 10: Golovanov399
Hope to see more Chinese participants at 13:35 UTC :)
I dont have a google account, could I register this? thanks
I think this is only a problem for Chinese users, right? If you still have trouble registering, please message me.
After all this time, really happy to see Repovive back on track!
Reminder: Less than 4 hours until the contest.
30 minutes.
Thanks for the contest. Happy to see that (at least for me) there were no system / preparation related issues, and contest experience was smooth. The problems were also alright.
Thanks for the kind words.
Should we assume the testing system is a potato and estimate runtime x2 compared to local, reasonably modern systems (or CF custom invocation)? I'm just about hitting TLE on E when I can't make my code run over 1.7s on an above-average but 3 year old laptop despite trying my best. My runtime shouldn't vary wildly on specifc inputs either, just grinding through data much faster on my laptop.
(Not that my code would pass otherwise, I'd need double the memlimit for it at least, but it matters going forward.)
Thanks for notifying us.
I am sure this issue was caused by the vCPUs (Noisy Neighbor problem).
But rest assured, we will add smart time scaling policies to handle these issues during pressure times!
I don't really get why the number of tests on problem E was low. The intended solution doesn't seem to use it much. I used it to make a $$$O(A \log(A) t + \sum n)$$$ pass
Yeah, it doesn’t affect the intended solution. But there were some other solutions that were affected, and we wanted those to be accepted. Your approach seems interesting.
Problem E reminds me of the old good days of cp xD (1329E - Dreamoon Loves AA)
1706D2 is also similar.