The finals of the 2020 Facebook Hacker Cup are less than 48 hours away!
On Sat. Dec. 5th at 6:30 — 10:30am PT, our 25 finalists will compete in our first all-virtual finals for the grand prize of $20,000 USD and title of Hacker Cup champion!
You can follow along with the scoreboard and contest problems here.
After the conclusion of the contest, at 11:00am PT, the results will be revealed in a live stream on the Hacker Cup Facebook page!
The Facebook post can be found here.
Update: The round has ended; congratulations to the finalists! The result reveal video can be found here, and the solutions here.
Update: Screencasts are available from Andrew He (ecnerwala) and Neal Wu.
Sorry
I am super surprised no one is from India as most of contestants on Codeforces are from India.
Why are there downvotes on this?
On Codeforces, not so many rounds are won by Indians too.
[Deleted]
I don't know who's taking it personally, but probably Gennady is very sad because of your comment, especially earning 1250$ every month only by winning Code Jams since he was 19.
I believe Radewoosh is right on this one. He's simply stating a fact. In India, competitive programming isn't considered a sport, it's considered a job requirement. There's nothing wrong with it given that India is a highly populous country and competitive programming is actually required by a lot of companies. Besides, I also think that we do well in chess and that's because the reasons for pursuing chess by any of our players is purely passion and curiosity, and nothing less.
Yeah, I agree that India is a very strong country if it comes to IT. If it comes to CP it's mostly considered as a job requirement, which is OK ofc, but India also has Codechef, which is one of the most known CP websites and is getting better and better nowadays. If it comes to the people who are getting to FHC finals it's mostly about personal motivation, I'm not exactly sure where is it getting from. The only sad thing about India is that every time I write something about this country, there are some people who take it as an attack xd There are no LGMs from India (today) and no really strong Indian competitive programmer comes to my mind, so why be surprised by no finalists.
Future LGM- Everule
Dude, he is just being condescending, ignore such comments.
Oh I see it now, best of luck for the finals.
We'll have a livestream for the results, but we won't have a livestream during the contest (though there'll be a live scoreboard as always).
Congrats on getting red LoneFox again!!
He first became red 5 years ago.
Hence the “again” :)
... ah, trolled by edit once again XD
Will Radewoosh's 43s-before-the-end-of-the-contest submission be the winning submission?
Well, at least we know that Errichto knows how to become top2 in last 5 minutes
(mostly thanks to the last geometry)
Ah, I forgot about this. Well, it was 3:59:18, so the submission was at the last minute as well.
And today he submitted problem F at 3h57m and currently 2nd. Interesting.
The submission is incorrect. Congratulation tourist for winning another Facebook Hacker Cup!
We both tried some random heuristics to find best independent set in a graph. I even used multi-threading but that wasn't enough.
It would be quite bad to win thanks to weak tests though.
Yesterday Errichto told us that his plan is to win this by pushing through some stupid brute/heuristic solution to the hardest problem. At least he stood by his promise
https://fb.watch/2bAGSwUBa2/
The Final Results
Update 1 : Gennady Won
Congrats tourist
congrats to all top 25 finalist!
F for radewoosh.
Gennady gotta gennady.
It's a pity that I spent over an hour debugging B (the logic was ultimately correct, but I wrongly constructed the tree), and it cost me the time to implement D. Aside from whining, I'd like to brag that I'm the only one to solve F. Here's my code.
And last but not least, I'd like to thank the organizers. I'm already looking forward to next FHC!
vc<W> unko;I guess even LGMs do this sometimes, on FHC Finals nonetheless xD
Gratz on the solve tho
From next FHC, just take top 24 in the final round because we all know whos gonna be in the first place :)
I uploaded my screencast at https://youtu.be/W6UWY1xoXbU if anyone wants to see. Congrats to tourist for winning!
did you try to solve F after the contest?
I tried, but didn't figure out the solution until I discussed it with ksun48. I'll probably try coding it on stream today.
I always appreciate the FBHC team for delivering such a great event! Here is my contest postmortem.
Could somebody explain why this is the case? In the editorial they simply say "The answer may then be computed as $$$\sum(S_{0..C_N})$$$" but they don't explain why.
Let $$$p_i$$$ be the probability that the process won't end for at least $$$i$$$ iterations.
Then if you sum up $$$p_1 + p_2 + \ldots$$$, the probability of the way that ends in exactly $$$i$$$ seconds will be counted exactly $$$i$$$ times. So you will derive the expected value.
Ah yes because $$$p_i = \sum_{j = i}^{C_N} p'_{j}$$$ where $$$p'_j$$$ is the probability that the process ends exactly at iteration j. Therefore it is counted exactly i times for each $$$p_i$$$ when you sum them. Thanks for explaining!