题目链接
思路:根据题目所说只炸一条铁路就要造成两个城市无法相互到达,换成人话就是删去一条边后两点无法连通,即连通分量增加,能造成这一效果的边无疑只有割边,所以直接tarjan求割边即可。
ac代码:
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
#define int long long
int n, m;
struct node {
int a, b;
};
vector<node> ans;
bool cmp(node a, node b) {
if (a.a == b.a) return a.b < b.b;
else return a.a < b.a;
}
int dfn[155], low[155];
vector<int> mmm[155];
int llll;
void init(int a, int fa) {//tarjan
llll++;
dfn[a] = low[a] = llll;
for (int i = 0; i < mmm[a].size(); i++) {
int t = mmm[a][i];
if (dfn[t] && t != fa) low[a] = min(low[a], low[t]);
if (!dfn[t]) {
init(t, a);
if (dfn[a] < low[t]) ans.push_back({ a,t });//回溯时判断是否是割边
low[a] = min(low[a], low[t]);
}
}
}
signed main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
mmm[a].push_back(b);
mmm[b].push_back(a);
}
init(1,0);
sort(ans.begin(), ans.end(), cmp);
for (int i = 0; i < ans.size(); i++) {
node g = ans[i];
cout << g.a << " " << g.b << endl;
}
return 0;
}