[luogu P1656] 炸铁路 ---- 无向图求桥

解析

前话：刚好他们再讲$tarjan$，发现刚好没有桥的板子，索性划个水吧
关键：

1. $low[v]>dfn[u]$
2. 重边不算桥（虽然说本题并没有这个坑点）

---

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>

#define IL inline

using namespace std; 

IL int read()
{
	int sum = 0;
	bool f = 0;
	char c = getchar();
	for(; '0' > c || c > '9'; c = getchar())
	if(c == '-') f = 1;
	for(; '0' <= c && c <= '9'; c = getchar())
		sum = sum * 10 + (c - '0');
	return f ? -sum : sum;
}

const int N(155), M(10005);

int last[N], _cnt;
int to[M], nxt[M];

int low[N], dfn[N];

int tot;
pair<int, int> ans[N];

IL void Add(int u, int v)
{
	nxt[++_cnt] = last[u]; last[u] = _cnt; to[_cnt] = v;
	nxt[++_cnt] = last[v]; last[v] = _cnt; to[_cnt] = u;
}

IL void tarjan(int u, int pre)
{
	dfn[u] = low[u] = ++_cnt;
	for(int i = last[u], v; i != -1; i = nxt[i])
	if(i != pre)
	{
		if(!dfn[(v = to[i])])
		{
			tarjan(v, i ^ 1);
			low[u] = min(low[u], low[v]);
			if(low[v] > dfn[u])
			{
				ans[++tot] = make_pair(u, v);
			}
		}else
		if(dfn[v] < dfn[u])
			low[u] = min(low[u], dfn[v]);
	}
}

int main()
{
	int n = read(), m = read();
	_cnt = -1;
	memset(last, -1, sizeof(last));
	for(int i = 1; i <= m; ++i)
	{
		 Add(read(), read());
	}
	
	_cnt = 0;
	for(int i = 1; i <= n; ++i)
	if(!dfn[i])
		tarjan(i, -1);
	
	sort(ans + 1, ans + tot + 1);
	
	for(int i = 1; i <= tot; ++i)
	{
		printf("%d %d\n", ans[i].first, ans[i].second);
	}

	return 0;
}