ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1664. Pipeline Transportation

Show all messages Hide all messages

dinic is all right
Does Dinic need some optimisation? It is O(n^2 * m) algorithm. This complexity is too large for 10^4 vertexes and 3*10^4 edges.
You should use as few variables as you can , in your dfs procedure. It does save time.
And you should 'delete' useless edges(which you've augmented it).
That's all measures I used in my dinic. And I got accepted within the limit.But still not too good.

Edited by author 27.05.2011 06:52