Codeforces Round 346 (Div. 2) E. New Reform(边双连通缩点、连通块)

题意: $N,M\le 10^5,N个点M条边的无向图,现在给每条边定向$$求定向后0入度的点的个数$     Read more
TaoSama's avatar
TaoSama Apr 07, 2016

Educational Codeforces Round 10 E. Pursuit For Artifacts(边双连通缩点)

题意: $N,M\le 3\times 10^5,N个点,M条边的无向图,无重边自环$$边权为0或1,问s\to t是否存权\ge 1且每条边经过一次的一条路径$     Read more
TaoSama's avatar
TaoSama Mar 28, 2016