disagreeLet the edges being:
1 2
2 0
1 3
3 0
1 4
4 0
is the max-flow 3? if true, then disagree since we can wait until the spy enter one of 2, 3 or 4.
so assume the spy enters 2
u then destroy the tunnel from 2 to 0, he can still go back to 1, and choose aon of 3 or 4
Huasing Association 1999 - 2013