Light OJ 1026 Critical Links 求桥

题目来源：Light OJ 1026 Critical Links

题意：输出桥

思路：模版

#include <vector>
#include <cstdio>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
const int maxn = 10010;
struct Edge
{
	int u, v;
	Edge(){}
	Edge(int u, int v): u(u), v(v){}
};
vector <int> a[maxn];
int pre[maxn];
int low[maxn];
int bccno[maxn];
Edge cnt[maxn];
int dfs_clock;
int bcc_cnt;
int bri;
int n, m;

stack <Edge> S;
bool cmp(Edge a, Edge b)
{
	if(a.u != b.u)
		return a.u < b.u;
	return a.v < b.v;
}
void dfs(int u, int fa)
{
	low[u] = pre[u] = ++dfs_clock;
	S.push(u);
	for(int i = 0; i < a[u].size(); i++)
	{
		int v = a[u][i];
		//if(v == fa)
		//	continue;
		if(!pre[v])
		{
			dfs(v, u);
			low[u] = min(low[u], low[v]);
			if(low[v] > pre[u])
			{
				if(u < v)
				{
					cnt[bri].u = u;
					cnt[bri].v = v;
				}
				else
				{
					cnt[bri].u = v;
					cnt[bri].v = u;
				}
				bri++;
			}
		}
		else if(v != fa)
			low[u] = min(low[u], pre[v]);
	}
}
void find_bcc()
{
	memset(pre, 0, sizeof(pre));
	memset(bccno, 0, sizeof(bccno));
	dfs_clock = bcc_cnt = bri = 0;
	for(int i = 0; i < n; i++)
		if(!pre[i])
			dfs(i, -1);
}
int main()
{
	int cas = 1;
	int T;
	scanf("%d", &T);
	while(T--)
	{
		scanf("%d", &n);
		for(int i = 0; i <= n; i++)
			a[i].clear();
		for(int i = 0; i < n; i++)
		{
			int u, v, m;
			scanf("%d (%d)", &u, &m);
			while(m--)
			{
				scanf("%d", &v);
				a[u].push_back(v);
				a[v].push_back(u);
			}
		}
		find_bcc();
		sort(cnt, cnt+bri, cmp);
		
		printf("Case %d:\n", cas++);
		printf("%d critical links\n", bri);
		for(int i = 0; i < bri; i++)
			printf("%d - %d\n", cnt[i].u, cnt[i].v);
	}
	return 0;
}