Is there a way to solve this problem in polynomial time?? You work in a candy factory. There are n Candy Boxes to fill. You can fill only 1 candy in any of the boxes in 1 second. Each Candy Box has it's own capacity c. Also each candy box has an automatic opening. Each box has a start time 'st' after which only you can start filling the candy in the box. Also each box has an end time 'et' after which you cannot fill the box. also given that for each box: et-st >= c
For given n Candy Boxes with start time and end time, find out all possible ways in which we can fill the 'n' boxes successfully. Number of candies are infinite. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/CABaJBv%2Bs2CxJn9LSRwoQzhpKWV2MzAShy1%2ByTkOBVqdvuCuagg%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
