UVA796 Critical Links【输出割边】

Critical Links

---

题意： 按字典序输出图中的所有割边。

题解： 存入set会自动排序，注意每组输出之间多一个空行。

#include<algorithm>
#include<iostream>
#include<set>
using namespace std;
#define _for(i, a, b) for(int i = (a); i <= (b); ++i)
const int N = 1e3 + 10;
const int M = 1e5 + 10;

int n, k, u, v;
int sum, dfn;
int cnt, head[M];
int num[N], low[N];
set<pair<int, int> > ans;
struct edge{ int u, v, next;} e[M];
void add(int u, int v) { e[cnt].u = u, e[cnt].v = v, e[cnt].next = head[u], head[u] = cnt++;}

void input() {
	cnt = 0; _for(i, 0, M - 1) head[i] = -1;
	_for(i, 1, n) {
		scanf("%d (%d)", &u, &k);
		while(k--) {
			scanf("%d", &v);
			add(u, v); add(v, u);
		}
	}
}

void dfs(int u, int fa) {
	num[u] = low[u] = ++dfn;
	for(int i = head[u]; ~i; i = e[i].next) {
		int v = e[i].v;
		if(v == fa) continue;
		if(!num[v]) {
			dfs(v, u);
			low[u] = min(low[u], low[v]);
			if(low[v] > num[u]) { 
				if(u < v) ans.insert({u, v});
				else ans.insert({v, u});
				sum++;
			}
		} else if(num[v] < num[u]) low[u] = min(low[u], num[v]);
	}
}

void tarjan() {
	sum = 0, ans.clear();
	_for(i, 0, n - 1) num[i] = low[i] = dfn = 0;
	_for(i, 0, n - 1) if(!num[i]) dfs(i, -1);
	printf("%d critical links\n", sum);
	for(set<pair<int, int> >:: iterator it = ans.begin(); it != ans.end(); it++)
		printf("%d - %d\n", it->first, it->second);
	puts("");
}

int main() {
	while(~scanf("%d", &n)) { input(); tarjan();}
    return 0;
}