### gilcu3's blog

By gilcu3, 10 years ago,

I'm looking for the solution or hints for the E problem, Efficient Cartography, ACM-ICPC NEERC 2010-2011 Moscow Subregional Contest, which can be found here. I have found the official solution here as well, but its in Russian, and I don't understand it, anyone willing to translate it, or solve the problem and post hints? thank you...

• +1

By gilcu3, 10 years ago,

I'm looking for a good source with deep theory and practice problems about probability, doesn't matter if it is too math involved, and I would prefer one that is ACM-ICPC training oriented.... thanks in advance..

• +13

By gilcu3, 10 years ago,

I know this problem CRYPTO4 a long time ago, and although I implemented all the ideas given here, and some of my own, I still get TLE, so, has someone around here solved it, and is willing to share some hints???

• 0

By gilcu3, 10 years ago,

Can somebody help me to find why this code gives WA: PON It's just a classical problem with a classical solution that should work fine...

Edit: Problem solved


• -12

By gilcu3, 10 years ago,

Hi everybody, I'm looking for the best max flow algorithm for real competitions, as ACM-ICPC regionals, recently there has been a problem in my regional that needed a very good implementation of Dinic's algorithm or the Hopcroft-Karp matching algorithm, so I'm asking for someone to point out the best performance implementation they have seen...

• +3