Sooner than expected! It was a fun problem set (despite my abysmal performance). Glad to see that I was right about min-cost max-flow being the solution for D; I did have a somewhat different graph in mind for it and was a bit unsure about whether my idea would handle the "almost-max-flow" part correctly.
Congratulations to the top 25! On Jun 12, 7:42 pm, Bartholomew Furrow <[email protected]> wrote: > http://code.google.com/codejam/contest/1835486/dashboard#s=a&a=4 > > I hope everybody enjoyed the problem set! -- You received this message because you are subscribed to the Google Groups "Google Code Jam" 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.
