oj.uz

Submission #156325

# Submission time Handle Problem Language Result Execution time Memory
156325 2019-10-05T06:49:57 Z Akashi Pipes (CEOI15_pipes) C++14
10 / 100
 1829 ms 61768 KB 
#include <bits/stdc++.h>
using namespace std;

struct dsu{
    int TT[100001];

    void init(int n){
        for(int i = 1; i <= n ; ++i) TT[i] = i;
    }

    void unite(int x, int y){TT[x] = y;}

    int find(int x){
        int R = x;
        while(R != TT[R]) R = TT[R];

        while(x != TT[x]){
            int aux = TT[x];
            TT[x] = R;
            x = aux;
        }

        return R;
    }

};

dsu A, B;
int n, m;
int low[100001], h[100001];
bool viz[100001];
vector <int> v[100001];

void tarjan(int nod, int papa = 0){
    viz[nod] = 1;
    for(auto it : v[nod]){
        if(papa == it) continue ;

        if(!viz[it]){
            low[it] = h[it] = h[nod] + 1;
            tarjan(it, nod);
            low[nod] = min(low[nod], low[it]);
            if(low[it] > h[nod]) printf("%d %d\n", it, nod);
        }
        else low[nod] = min(h[it], low[nod]);
    }
}

int main()
{
    scanf("%d%d", &n, &m);

    A.init(n); B.init(n);

    int x, y;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d", &x, &y);
        if(A.find(x) != A.find(y)){
            v[x].push_back(y);
            v[y].push_back(x);
            A.unite(A.find(x), A.find(y));
        }
        else if(B.find(x) != B.find(y)){
            v[x].push_back(y);
            v[y].push_back(x);
            B.unite(B.find(x), B.find(y));
        }
    }

    for(int i = 1; i <= n ; ++i) if(!viz[i]) tarjan(i);

    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Incorrect 4 ms 2680 KB Wrong number of edges

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3192 KB Output is correct
2 Incorrect 9 ms 2936 KB Wrong number of edges

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 3028 KB Output is correct
2 Incorrect 146 ms 2880 KB Wrong number of edges

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 260 ms 3700 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 5116 KB Output is correct
2 Correct 365 ms 4876 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 600 ms 10104 KB Output is correct
2 Incorrect 536 ms 7152 KB Wrong number of edges

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 932 ms 11144 KB Output is correct
2 Runtime error 881 ms 42104 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1240 ms 13076 KB Output is correct
2 Runtime error 1163 ms 50396 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1511 ms 16084 KB Output is correct
2 Runtime error 1437 ms 61768 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1829 ms 28524 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -