题意:求桥
ps:本题不存在重边
桥:当且仅当 (u,v) 为父子边,且满足 dfn[u] < low[v]
割点、桥详解:http://www.lydshy.com/wordpress/115
#include <cstdio>
#include <iostream>
#include <cstring>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <queue>
#include <cmath>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <sstream>
#include <functional>
#include <algorithm>
using namespace std;
#define mem(a,n) memset(a,n,sizeof(a))
#define memc(a,b) memcpy(a,b,sizeof(b))
#define rep(i,a,n) for(int i=a;i<n;i++) ///[a,n)
#define dec(i,n,a) for(int i=n;i>=a;i--)///[n,a]
#define pb push_back
#define fi first
#define se second
#define IO ios::sync_with_stdio(false)
#define fre freopen("in.txt","r",stdin)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
typedef unsigned long long ull;
const double PI=acos(-1.0);
const double E=2.718281828459045;
const double eps=1e-8;
const int INF=0x3f3f3f3f;
const int MOD=258280327;
const int N=1e3+5;
const ll maxn=1e6+5;
const int dir[4][2]= {-1,0,1,0,0,-1,0,1};
int dfn[N];
///dfn[u]表示顶点u第几个被(首次)访问,
int low[N];
///low[u]表示顶点u及其子树中的点,通过非父子边(回边),能够回溯到的最早的点(dfn最小)的dfn值(但不能通过连接u与其父节点的边)
bool cut[N];///记录割点
int n;
bool vis[N];
int par[N];
struct Node
{
int u,v;
bool operator < (const Node& m)const
{
if(u!=m.u) return u<m.u;
return v<m.v;
}
} ans[N];
vector<int>g[N];
void init()
{
mem(par,0);
mem(cut,0);
mem(vis,0);
mem(dfn,0);
mem(low,0);
rep(i,0,n+1) g[i].clear();
}
void tarjan(int u,int fa)
{
vis[u]=1;
par[u]=fa;
static int cnt=0;
dfn[u]=low[u]=++cnt;
for(int v:g[u])
{
if(!vis[v])
{
tarjan(v,u);
low[u]=min(low[u],low[v]);
}
else if(fa!=v)
low[u]=min(low[u],dfn[v]);
}
}
void solve()
{
int num=0;
for(int i=0; i<n; i++) if(!vis[i]) tarjan(i,-1);
for(int i=0; i<n; i++)
{
int fa=par[i];
if(fa!=-1&&low[i]>dfn[fa])
{
ans[num].u=i,ans[num].v=fa;
if(i>fa) swap(ans[num].u,ans[num].v);
num++;
}
}
sort(ans,ans+num);
printf("%d critical links\n",num);
for(int i=0; i<num; i++)
printf("%d - %d\n",ans[i].u,ans[i].v);
puts("");
}
int main()
{
//fre;
while(~scanf("%d",&n))
{
init();
int m,u,v;
rep(i,0,n)
{
scanf("%d (%d)",&u,&m);
while(m--)
{
scanf("%d",&v);
g[u].pb(v);
g[v].pb(u);
}
}
solve();
}
return 0;
}