Hello everyone!
We are back with another Premier round!
Repovive Premier Round 5 will be held this Sunday.
Premier rounds are currently the highest level among our contest series. We hope you enjoy it!
- Start Time: Sunday, 21 June 2026, 14:35 (UTC)
- Duration: $$$2:30$$$ hours
- Registration: https://repovive.com/contests/13
The contest is rated for everyone.
- Writers: AmirAli-Asgari, Hamed_Ghaffari, _R00T.
- Testers: Ali_BBN, Amoo_Safar, Bahamin, mohammadsam, AlefHeKaaf and AmShZ.
See you on the leaderboard!
UPD1: We apologize for the short issue that the website had for around $$$5$$$ minutes during the contest. Thank you for your patience.
You can now view the solutions in the Learn tab.
Congratulations to the top participants:
- 1: maroonrk
- 2: Benq
- 3: PinkieRabbit
- 4: Um_nik
- 5: potato167
- 6: Rubikun
- 7: 244mhq
- 8: Andimeo
- 9: physics0523
- 10: alireza_kaviani
Auto comment: topic has been updated by AmShZ (previous revision, new revision, compare).
If we compare it to cf contests what will be rating of this round?
Near div.1+div.2
Getting the following error message while submitting problem B :
Timed out while checking out a connection from connection pool
Was the time limit on G intended to force an $$$O(N\log N)$$$ solution? For the majority of the round I was attempting to optimize an $$$O(N\log^2N)$$$ solution without involving Catalan numbers, which unfortunately ended up being too slow (~3s locally and ~6s on the judge for $$$N=2\cdot 10^5$$$).
The intended solution was $$$O(N \log N)$$$, and the time limit was mainly set based on that.
We were not aware of an $$$O(N \log^2 N)$$$ approach during preparation, so the limit was tuned around the intended $$$O(N \log N)$$$ solutions rather than specifically against that approach.
I see. I (incorrectly) assumed that if the intended solution was $$$O(N\log N)$$$ then the constraints would have been set much higher. My $$$O(N\log N)$$$ solution after the contest runs in <0.5s on the judge platform for $$$N=10^6$$$.
Auto comment: topic has been updated by AmShZ (previous revision, new revision, compare).