# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1028124 | qwewq | Pipes (CEOI15_pipes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5;
vector < int > adj[N + 2];
struct dsu{
int par[N + 2];
int find_par(const int &u){
if(par[u] < 0)return u;
par[u] = find_par(par[u]);
return par[u];
}
bool union_set(int u , int v){
u = find_par(u);
v = find_par(v);
if(u != v){
if(par[u] > par[v])swap(u , v);
par[u] += par[v];
par[v] = u;
return true;
}
return false;
}
} par1 , par2;
int timer = 0;
int n , m;
void dfs(int &c, int depth, int &par){
par1.par[c] = depth;
par2.par[c] = par1.par[c];
int op = par;
for (int i : adj[c]){
if (i == par){ continue;}
if (par1.par[i] != -1){ par2.par[c] = min( par2.par[c] ,par1.par[i]); continue;}
dfs(i,depth+1,c);
par2.par[c] = min(par2.par[c] , par2.par[i]);
}
if (par2.par[c] >= depth && op != -1) cout << c << " " << op << '\n';
}
void solve() {
cin >> n >> m;
for(int i = 1; i <= n; i++){
par1.par[i] = par2.par[i] = -1;
}
for(int i = 1; i <= m ;i ++){
int u , v;
cin >> u >> v;
if(par1.union_set(u , v)){
adj[u].push_back(v);
adj[v].push_back(u);
// cout << u << ' ' << v<< '\n';
}
else if(par2.union_set(u , v)){
adj[u].push_back(v);
adj[v].push_back(u);
// cout << u << ' '<< v << '\n';
}
}
for(int i = 1; i <= n ; i ++){
par1.par[i] = par2.par[i] = -1;
}
for(int i = 1; i <= n ; i++){
if(par1.par[i] == -1)dfs(i , 0 , -1);
}
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
#define _ "maxseq."
if (fopen(_ "inp", "r")) {
freopen(_ "inp", "r", stdin);
freopen(_ "out", "w", stdout);
}
solve();
}