#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()
#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,
r[100001], p[100001], h[100001], d[100001];
bool u[100001];
vector<int> com[100001];
bool mrg(int A, int B){
A=r[A]; B=r[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){
p[N]=P;
if (P!=-1) d[N]=d[P]+1; else d[N]=0;
fox(l, com[N].size()){
if (com[N][l]==P) continue;
dfs(com[N][l], N);
}
}
void lca(int X, int Y){
X=r[X]; Y=r[Y];
while(X!=Y){
if (d[X2=h[X]]>d[Y2=h[Y]]){
u[X2]=1;
t=h[r[p[X2]]];
mrg(X, p[X2]);
h[X]=t;
} else {
u[Y2]=1;
t=h[r[p[Y2]]];
mrg(Y, p[Y2]);
h[Y]=t;
}
X=r[X]; Y=r[Y];
}
}
int q[100001];
int main(){
scan(n); scan(m);
fox1(l, n){
r[l]=l;
com[l].clear(); com[l].pb(l);
}
fox(l, m){
scan(a); scan(b);
if (mrg(a, b)){
//cout << l << endl;
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]==0){
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 lca(a, b);
}
fox1(l, n){
if (!u[l] && p[l]!=-1){
printf("%i %i\n", l, p[l]);
}
}
return 0;
}
Compilation message
pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fox(k, x) for (int k=0; k<x; ++k)
pipes.cpp:47:9:
fox(l, com[N].size()){
~~~~~~~~~~~~~~~~
pipes.cpp:47:5: note: in expansion of macro 'fox'
fox(l, com[N].size()){
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2688 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
3072 KB |
Output is correct |
| 2 |
Correct |
7 ms |
3072 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
93 ms |
2936 KB |
Output is correct |
| 2 |
Correct |
91 ms |
3064 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
156 ms |
3444 KB |
Output is correct |
| 2 |
Correct |
183 ms |
3576 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
290 ms |
4404 KB |
Output is correct |
| 2 |
Correct |
254 ms |
4856 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
388 ms |
7840 KB |
Output is correct |
| 2 |
Correct |
334 ms |
7892 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
658 ms |
8412 KB |
Output is correct |
| 2 |
Correct |
584 ms |
8752 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
851 ms |
9820 KB |
Output is correct |
| 2 |
Correct |
794 ms |
9920 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1043 ms |
9688 KB |
Output is correct |
| 2 |
Correct |
999 ms |
9968 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1350 ms |
9232 KB |
Output is correct |
| 2 |
Correct |
1194 ms |
10048 KB |
Output is correct |
