| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1034711 | vjudge1 | Pipes (CEOI15_pipes) | C++17 | 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>
using namespace std;
#define vt vector
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<class T> bool chmin(T& a, const T& b) {
return b<a?a=b, 1:0;
}
template<class T> bool chmax(T& a, const T& b) {
return a<b?a=b, 1:0;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
//#pragma GCC optimize("O3,unroll-loops")
/**
* Author: Lukas Polacek
* Date: 2009-10-26
* License: CC0
* Source: folklore
* Description: Disjoint-set data structure.
* Time: $O(\alpha(N))$
*/
const int N = 30'010;
namespace d1 {
int e[N];
int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
bool sameSet(int a, int b) { return find(a) == find(b); }
bool join(int a, int b) {
a = find(a), b = find(b);
if (a == b) return false;
if (e[a] > e[b]) swap(a, b);
e[a] += e[b]; e[b] = a;
return true;
}
};
namespace d2 {
int e[N];
int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
bool sameSet(int a, int b) { return find(a) == find(b); }
bool join(int a, int b) {
a = find(a), b = find(b);
if (a == b) return false;
if (e[a] > e[b]) swap(a, b);
e[a] += e[b]; e[b] = a;
return true;
}
};
vt<int> g[N+1];
int low[N+1], id[N+1], par[N=1];
int timer=0;
void dfs(int at) {
bool ck=0;
id[at]=low[at]=++timer;
for(int to:g[at]) {
if(to == par[at] and ck==0) {
ck=1;
continue;
}
if(id[to]) {
low[at]=min(low[at], id[to]);
} else {
par[to]=at;
dfs(to);
low[at]=min(low[at], low[to]);
}
}
if(low[at] == id[at] and at!=par) {
cout << at << " " << par << "\n";
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, m;
cin >> n >> m;
int u, v;
int cnt=0;
memset(d1::e, -1, sizeof d1::e);
memset(d2::e, -1, sizeof d2::e);
rep(i, 0, m) {
cin >> u >> v;
if(d1::join(u, v) || d2::join(u, v)) {
g[u].pb(v);
g[v].pb(u);
}
}
for(int i= 1;i<=n;i++) {
if(!id[i])
dfs(i);
}
}