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;
typedef long long ll;
const int K = 17;
vector<int> link[100002];
int par[100002], LCADB[100002][K], sz[100002], depth[100002];
int val[100002];
inline int find(int x){
if(x==par[x]) return x;
return find(par[x]);
}
inline void sps_dfs(int x, int p){
for(int i=1; i<K; i++) LCADB[x][i] = LCADB[LCADB[x][i-1]][i-1];
for(int y: link[x]){
if(p != y){
par[y] = LCADB[y][0] = x;
depth[y] = depth[x] + 1;
sps_dfs(y, x);
}
}
}
inline void merge(int x, int y){
int rx = find(x), ry = find(y);
if(rx==ry) return;
if(sz[rx] < sz[ry]) swap(rx, ry), swap(x, y);
link[x].push_back(y), link[y].push_back(x);
LCADB[y][0] = par[y] = x, sz[rx] += sz[ry];
depth[y] = depth[x] + 1;
sps_dfs(y, x);
}
inline int getLCA(int x, int y){
if(depth[x] > depth[y]) swap(x, y);
for(int d=0; d<K; d++) if((depth[y]-depth[x])&(1<<d)) y = LCADB[y][d];
if(x==y) return x;
for(int d=K-1; d>=0; d--) if(LCADB[x][d] != LCADB[y][d]) x = LCADB[x][d], y = LCADB[y][d];
return par[x];
}
int n, m;
void dfs(int x, int p=-1){
for(int y: link[x]){
if(y==p) continue;
dfs(y, x);
val[x] += val[y];
}
}
int main(){
scanf("%d %d", &n, &m);
for(int i=1; i<=n; i++) par[i] = i, sz[i] = 1;
while(m--){
int x, y;
scanf("%d %d", &x, &y);
if(find(x) == find(y)){
val[x]++, val[y]++;
val[getLCA(x, y)] -= 2;
}
else merge(x, y);
}
for(int i=1; i<=n; i++) if(par[i] == i) dfs(i);
for(int i=1; i<=n; i++){
if(par[i] != i && !val[i]) printf("%d %d\n", par[i], i);
}
}
Compilation message (stderr)
pipes.cpp: In function 'int main()':
pipes.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
57 | scanf("%d %d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
61 | scanf("%d %d", &x, &y);
| ~~~~~^~~~~~~~~~~~~~~~~
# | 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... |