| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 32840 | imaxblue | 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<cstdio>
#include<vector>
using namespace std;
#define pb push_back
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
int n, m, t, a, b, X2, Y2, P, X, Y
r[100001], p[100001], h[100001], d[100001];
bool u[100001];
vector<int> com[100001];
inline bool mrg(int A, int B){
if (A==B) return 0;
if (com[A].size()<com[B].size()) return mrg(B, A);
for (auto i:com[B]){
com[A].pb(i);
r[i]=A;
}
return 1;
}
void dfs(int N, int P){
if ((p[N]=P)>0) d[N]=d[P]+1;
fox(l, com[N].size()){
if (com[N][l]==P) continue;
dfs(com[N][l], N);
}
}
void lca(int X, int Y){
}
int q[100001];
int main(){
scan(n); scan(m);
fox1(l, n){
com[r[l]=l].clear(); com[l].pb(l);
}
fox(l, m){
scan(a); scan(b);
if (mrg(r[a], r[b])){
h[P]=a;
d[P]=b;
q[P++]=l;
}
}
fox1(l, n)
com[l].clear();
fox(l, P){
com[h[l]].pb(d[l]);
com[d[l]].pb(h[l]);
}
fox1(l, n)
if (!p[l]) dfs(l, -1);
fox1(l, n){
r[l]=l; h[l]=l;
com[l].clear(); com[l].pb(l);
}
P=0;
rewind(stdin);
scan(n); scan(m);
fox(l, m){
scan(a); scan(b);
if (l==q[P]) ++P;
else {
X=r[a]; Y=r[b];
while(X!=Y){
if (d[X2=h[X]]>d[Y2=h[Y]]){
u[X2]=1;
t=h[r[p[X2]]];
mrg(X, r[p[X2]]);
h[X]=t;
} else {
u[Y2]=1;
t=h[r[p[Y2]]];
mrg(Y, r[p[Y2]]);
h[Y]=t;
}
X=r[X]; Y=r[Y];
}
}
}
fox1(l, n){
if (!u[l] && p[l]>0){
printf("%i %i\n", l, p[l]);
}
}
return 0;
}