Yes - see for example linguo's solution. He solved bilingual as an integer linear programming problem too.
Edward > On 9 Jun 2015, at 21:09, bigOnion <[email protected]> wrote: > > During round 2 I recognized that problem B can be described as a Linear > Programming problem. > > There are two restrictions: > R_1 * t_1 + ... + R_n * t_n = V > C_1 * R_1 * t_1 + ... + C_n * R_n * t_n = V * X > > t_1, ..., t_n are all non-negative > > Finally the objective is: > Minimize (max{t_1, ..., t_n} ) > > That's quite a regular LP problem. > > I know that obviously coding a solution to LP is much harder than the simple > analysis of this specific problem. Nevertheless, I was wondering – did anyone > tried to solve it this way? I know that LP might need more time to solve. Is > it doable in the GCJ time constraints (i.e., does it take less than 8 minutes > to get the full output?) Does anyone know? > > -- > 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/e782962e-7d0e-4fb0-b46d-d39f850e346b%40googlegroups.com. > For more options, visit https://groups.google.com/d/optout. -- 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/CD8F176F-A884-4F52-8CD6-30C1E8BE60D1%40gmail.com. For more options, visit https://groups.google.com/d/optout.
