Round 3 of the 2020 Facebook Hacker Cup is less than 48 hours away!
The round will begin on September 12th, 2020 at 10am PDT and will last for 3 hours. The contest can be found here.
You're eligible to compete in Round 3 if you were among the top 200 contestants in Round 2.
The top 25 contestants will also advance to the Final Round, which will be hosted virtually and live streamed at www.facebook.com/hackercup later this year. Please note that all submission judgments will only be revealed after the round ends, and that time penalty will be used to break score ties. More details about rules and other information can be found in the FAQ.
We wish you the best of luck, and hope that you enjoy the contest!
The Facebook post can be found here.
Update: The round has ended, thank you for participating! The scoreboard can be found here, and the solutions here.
I know this is a bit random, but does anyone know when t-shirts will be delivered?
From Rd 2 post:
Predictions?
My guess:
upd: Seems like Um_nik is going to win(if no FST)
Result:
You forgot to put a '9' in front of the '5'.
Last time I was pretty vocal about the ugliness of problem D (of round 2).
This time, I want to say that problems B and C were very cool. For me, they were both interesting, fun to solve and with an appropriate difficulty.
Congratulations to the organizers!
Thanks for the feedback! It's always good to know what people like/dislike.
Agreed, really liked B.
I would like to second this, problems this time were much better than in previous rounds.
Thanks for the contest!
C has a similar trick as Boomerang Crews.
Edit: Even multiple tricks I guess. In both problems, you have to binary search for the result and then do the trick with pairing elements by maintaining items sorted by value modulo something.
I'm kinda glad that you spent all bad problems on round 2 and left all good ones to round 3 :) I enjoyed BCD, especially B (looks like it was easier for lots of people than for me, maybe I didn't know some trick).
Sysfail on B, C :( btw, problemset was far better than previous rounds. Great job!
Also: I enjoyed the problems, finishing D at the end gave me that heart-pounding which we all love in CP. Thanks for the contest.
Thanks for the round! Seconding all the comments about the improved problem quality this round--I wasn't a huge fan of either Rounds 1 or 2, but I thought all the tasks this round were exceptionally fun to solve. The observations for D were especially nice!
I definitely did not expect to place in the top 25 this year, but I'm thrilled to have made the cut and can't wait to compete at WF later this year!
Is it ok that in statement of C $$$T\le 90$$$, but in the input file I got $$$T = 113$$$? Not that it affected me, my code had bugs, but this is quite suspicious. And some submissions which got AC also WA on my input file...
In practice mode, T may be higher than the listed bounds because we give you the complete file.
Got it, thanks
Complete file compared to what? Do you give different inputs to different participants?
Samples and validation tests are included.
I thought they are nested as is, I'm pretty sure that when I glance over the output file to ensure that I have run the code I always see answer for samples.
Yes, they give different input to different participants. I think the point is to discourage/detect cheating where someone submits someone else's output.
That's a bit unfare, isn't it?
Are you worried that the exact set of cases being different could affect runtime? I don't know the details, but I believe the random subset is selected intelligently with multiple pools based on size/shape/etc. (Also, 90/113 is pretty much all of them anyways.)
LoneFox knows more details, I remember seeing some comment from him about this, but I can't find it now.
That's right, there's only a bit of variation — everybody receives all of the large and/or "important" cases within their input file.
Imagine a mailbox so small that it cannot even contain its own key lmao
If I got a tshirt, should I wait until the shipping to deactivate my account?