Hello everyone!
I would like to invite you to participate in HackerEarth January Circuits. It's a long contest that will start on January, 20, 21:00 IST (check your timezone). Contest will run for 8 days.
The participants will be challenged by multiple Problem Setters with 7 traditional algorithmic tasks and 1 approximate problem of varying difficulty levels in a duration of 8 days. For 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. For the approximation task, your score depends on the best solution in the contest so far. Here is the detailed time line of the challenge,
- Day-0 : Problem-1 (Easy) , Problem-2 (Medium), Approximate
- Day-2 : Problem-3 (Easy-Medium) , Problem-4 (Medium-Hard)
- Day-4 : Problem-5 (Easy-Medium) , Problem-6 (Medium-Hard)
- Day-6 : Problem-7 (Hard)
- Day-7 : Challenge Ends
I am one of the Problem Setters. I'd like to thanks prat33k, vaibhavjaimini, gamer12 and Lewin for preparing the tasks, FatalEagle for testing them and MikeMirzayanov for creating Polygon.
The contest will be RATED.
Happy Coding :)
UPD: Problem-3 and Problem-7 will not have partial scoring.
UPD1: Solutions of the Setter and Tester was wrong for Problem 7. This is a big mistake from our side. We are sorry for the inconvenience. Due to this, the January Circuits will be UNRATED. Regarding the prizes, we will distribute the prizes on the basis of score of the other 7 problems.
Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).
Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).
Contest will be live in 2 hours.
Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).
Problem 7 is wrong. See this testcase
The link is broken
Fixed
Yes. I had a discussion regarding this with the Setter. He told me that his solution is wrong. Sorry for the inconvenience.
Can someone please explain how to solve the last problem, Space Escape? As usual on Hackerearth (at least for the last few contests), the "editorial" contains only the setter/tester solutions and no explanation whatsoever.
I suspect that this could be an NP problem. Imagine the following variant of this problem were the initial conditions are not T credits in the first room and zero on the others but instead you have T credits in all rooms. Then if the capacity of the doors is very big and the tax to pay in each door is small, the optimal solution will be to collect the credits from all the rooms and pay the minimum tax, i.e. the same solution as traveling salesman problem.
The problem 7 regarding "Transactions" was exactly the same as this problem, even the input format as well and every constraints.
Thanks for pointing it out. I will look into this. This is a mistake from our side. Sorry for the inconvenience.
Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).