Hello,
I have recently been doing this problem 701F - Break Up.
While it does not have an explanation in the official editorial, some user made an informal editorial.
The solution goes like this
I wrote Tarjan's for finding bridges, but then realized such a solution doesn't even pass the samples because a bridge is only guaranteed to split the graph into two components, but not necessarily separating the vertex s from t. How can I modify the algorithm to only consider bridges that split s and t?
