RECursion, the coding community of NIT Durgapur, is organizing an ACM-ICPC style based contest ALOHOMORA in association with JetBrains. The contest will be held in two stages, online round and onsite round. The online round will be held on 03 March at 22:30 IST.
There will be 6 problems which are to be solved in 2 hours and 30 mins .
Participants need to register themselves in teams of max 2 members. Top 6 teams from NIT Durgapur and Top 9 teams from other institutions in the online round will qualify for the onsite round. The onsite round will be held on 21st March 2020.
There are cash prizes for the winners of Onsite Round :
1st team: Rs.5000/-
2nd team: Rs.3000/-
Teams qualifying for the onsite round will also get CodeChef Goodies, Laddus and JetBrains Goodies.
JetBrains is providing free licenses to all its IDEs for coding in Java, Kotlin, C++, Python, JavaScript, and more languages to the student participants of Alohomora. You can get your free Educational Pack at Free Educational Licenses - Community Support
We invite you all to participate in the event.
Happy Coding
How to solve this problem ? I thought using arranging monsters on the basis of the time they first reach L and then using binary search to find the current monster to kill.
Used almost same approach as sorting them on the basis of reaching time, but maintained a priority queue to get the monster with maximum damage in any instance of time. Similar problem to this: IPCTRAIN
Teams qualifying for the onsite round will also get CodeChef Goodies, Laddus and JetBrains Goodies.
Will those who won’t be able to come for onsite but qualified for onsite be given any of the above prizes?
Can anyone please tell me , If the cost of every edge in a graph is constant , can we use simple bfs shortest path or should we go with dijisktra’s algorithm .