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 pb push_back
const int N = 1e5+5;
mt19937 rng(time(0));
// upravo sam imao najgenijalniju ideju svih vremena
vector<int> g[N];
int p[N], dp[N], vis[N];
int get(int x) {
if (x == p[x]) return x;
return p[x] = get(p[x]);
}
bool unite(int u, int v) {
if (get(u) == get(v)) return 0;
p[get(v)] = get(u);
g[u].pb(v); g[v].pb(u);
return 1;
}
void upd(int u, int v) {
int x = rng() % (1LL << 31);
dp[u] ^= x;
dp[v] ^= x;
}
void dfs(int s, int e = 0) {
for (auto u : g[s]) {
if (u == e) continue;
dfs(u, s);
dp[s] ^= dp[u];
}
if (e && !dp[s]) cout << e << ' ' << s << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
iota(p, p+N, 0);
int n, m;
cin >> n >> m;
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
if (!unite(u, v)) upd(u, v);
}
for (int i = 1; i <= n; ++i) {
if (!vis[get(i)]) {
dfs(get(i));
vis[get(i)] = 1;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |