Great Neck South High School's Programming Club is hosting its second-ever contest! The December '22 Decrementation Division contest will run from 2:45 to 3:45 PM (EST) on Thursday, December 1st. To convert to your timezone, click here.
This is a beginner/educational contest. There will be 3 problems with difficulty ranging from -300 to 1200. The contest is only 1 hour, but the problems will be fairly easy, as this is the first of three contests of increasing difficulty.
Join the contest here! The contest will become visible only when it starts. Also, send DMs to the user GNSCO for any questions.
Go participate!!!
Reminder that this is tomorrow! Good luck everyone~
no cap kinda neato burrito
Contest will be delayed by a few minutes
The contest has started, one problem has been released out of three. The following problems will be released later.
Great Contest guys!! Keep it up :D
Any approach for C? I thought of first removing <= k ones, sorted in decreasing order by damage, for rest, just sorted increasing order by hp. Could'nt get right answer for the 2nd TC tho
First you compute for every minion the number of hits after which it will die. ceil(h[i]/x)
Notice that when you strike a monster you should continue to strike it until it dies, otherwise you will be dealt more damage.
So you need to find a sorting of the minions which minimizes summation(prefixHits[i]*A[i]), where prefixHits is the prefix sum of the (sorted) array of minions.
The problem is reduced to https://www.codechef.com/problems/MUSROD which has an editorial.
Basically you sort them in decreasing order of attack/hits and then you just compute the result and add 1
Ohh got it.. Thank you!! Can you please provide your solution for reference~
https://ideone.com/PJPG87
Thank youu <3