-- 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/538C8A99.4060400%40mailbolt.com. For more options, visit https://groups.google.com/d/optout.
I really enjoyed the problem set for round 2. I still haven't figured
out the solution for problem C though, Don't Break the Nile. Can anyone
give me the short version while we wait for the analysis? I can see how
it could be modeled as a maximum flow problem, but it would be way too
large to be solvable. I assume from the large constraints it should be
possible to process row-by-row up the river, but any method I can think
of breaks down on maze-like rivers with dead ends, etc. where it seems
like you would need to backtrack.
- [gcj] Don't Break the Nile Matt Weaver
- Re: [gcj] Don't Break the Nile Luke Pebody
- Re: [gcj] Don't Break the Nile Matt Weaver
- [gcj] Re: Don't Break the Nile Cygin
