AmShZ's blog

Repovive Standard Round 2
By AmShZ, 6 months ago, In English

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!

The contest is rated for everyone.

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:

  • Vote: I like it
  • +45
  • Vote: I do not like it

»
6 months ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

Hope to see more Chinese participants at 13:35 UTC :)

→ Reply
»
6 months ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

I dont have a google account, could I register this? thanks

→ Reply
  • »
    »
    6 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    I think this is only a problem for Chinese users, right? If you still have trouble registering, please message me.

    → Reply
»
6 months ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

After all this time, really happy to see Repovive back on track!

→ Reply
»
6 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Reminder: Less than 4 hours until the contest.

→ Reply
»
6 months ago, hide # |
 
Vote: I like it +26 Vote: I do not like it

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.

→ Reply
»
6 months ago, hide # |
 
Vote: I like it +20 Vote: I do not like it

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.)

→ Reply
  • »
    »
    6 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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!

    → Reply
»
6 months ago, hide # |
← Rev. 2  
Vote: I like it +10 Vote: I do not like it

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

→ Reply
  • »
    »
    6 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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.

    → Reply
»
6 months ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

Problem E reminds me of the old good days of cp xD (1329E - Dreamoon Loves AA)

→ Reply