Hi everyone!
I would like to invite you to participate in HackerEarth Hourstorm #11. The contest will start at 16:00 UTC,May 20, 2019
It's a 1-hour competition with 3 traditional algorithmic tasks. You will receive points for every test case your solution passes so you can get some points with partial solutions as well. Check the contest page for more details about contest schedule and rules.
The problems have been prepared by me and tested by Arpa. There are prizes for top 3 contestants: $75, $50 and $25 Amazon gift cards respectively. In addition, the top 5 will win HackerEarth t-shirts.
Good Luck and High Ratings!
Clashes with codejam round 2.
The contest was rescheduled to 16:00 UTC,May 20, 2019
Please update the time on the blog itself
Cook-off is today.
Auto comment: topic has been updated by Danylo99 (previous revision, new revision, compare).
In problem 2 Maximum Area editorial, it is written that we have to run N multisource Dijkstra from every column. I didn't understand this. How can we consider an entire column as a single source.
Add another node and connect it to those vertices inside the column with an edge cost of zero and do dijkstra from this node (OR) simply push all those vertices belonging to that column into a priority queue directly both are same .
So that means we are ignoring the weights within the column. Right?
we are assign those edge cost's as zero, google for multisource bfs and you will get that idea.