oj.uz

Submission #32844

# Submission time Handle Problem Language Result Execution time Memory
32844 2017-10-15T20:36:40 Z imaxblue Pipes (CEOI15_pipes) C++14
100 / 100
 1146 ms 10040 KB 
#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];
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);
    }
}
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;
}

Compilation message

pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:5:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
pipes.cpp:26:9:
     fox(l, com[N].size()){
         ~~~~~~~~~~~~~~~~          
pipes.cpp:26:5: note: in expansion of macro 'fox'
     fox(l, com[N].size()){
     ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 7 ms 2944 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 2964 KB Output is correct
2 Correct 93 ms 2972 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 3420 KB Output is correct
2 Correct 182 ms 3448 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 4344 KB Output is correct
2 Correct 248 ms 4872 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 397 ms 7764 KB Output is correct
2 Correct 486 ms 7920 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 8376 KB Output is correct
2 Correct 579 ms 8696 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 787 ms 9676 KB Output is correct
2 Correct 830 ms 9968 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 997 ms 9712 KB Output is correct
2 Correct 921 ms 9972 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1146 ms 9320 KB Output is correct
2 Correct 1141 ms 10040 KB Output is correct