The problem says: 'At the end of the day all the buses must be in the last K bus stops (one bus per stop)'
This is not true for the case you mentioned. On Aug 30, 8:56 pm, pos <[email protected]> wrote: > Hello, > About the problem bus stops, for the second sample answer I think > there is a missing > schedule.http://code.google.com/codejam/contest/dashboard?c=32010#s=p3 > > the sample: > Input: > 3 > 10 3 3 > 5 2 3 > 40 4 8 > ------------------------ > Output: > Case #1: 1 > Case #2: 3 > Case #3: 7380 > > your explanation for the second case is: > For the second case the possible ways of planning are: > (A → 1,3,5. B → 2,4), > (A → 1,3,4. B → 2,5), > (A → 1,4. B → 2,3,5). > > I thin there is a missing schedule, > (A → 1,3. B → 2,4,5) > > What do you think? > Many thanks in advanced --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
