oj.uz

Submission #208220

# Submission time Handle Problem Language Result Execution time Memory
208220 2020-03-10T10:11:38 Z alexandra_udristoiu Pipes (CEOI15_pipes) C++14
0 / 100
 5000 ms 3576 KB 
#include<iostream>
#include<vector>
#define DIM 100005
using namespace std;
int n, m, i, x, y, r1, r2;
int r[DIM], ok[DIM], t[DIM], nxt[DIM], niv[DIM];
vector<int> v[DIM];
int rad(int x){
    while(r[x] > 0){
        x = r[x];
    }
    return x;
}
int urm(int x){
    int y, aux;
    y = nxt[x];
    while(ok[y] == 1){
        y = nxt[y];
    }
    while(x != y){
        aux = nxt[x];
        nxt[x] = y;
        x = aux;
    }
    return y;
}
void dfs(int nod, int tt){
    niv[nod] = 1 + niv[tt];
    for(int i = 0; i < v[nod].size(); i++){
        if(v[nod][i] != tt){
            dfs(v[nod][i], nod);
        }
    }
    if(t[nod] != tt){
        ok[ t[nod] ] = ok[nod];
        t[nod] = tt;
        nxt[nod] = t[nod];
    }
}
int main(){
    cin>> n >> m;
    for(i = 1; i <= n; i++){
        r[i] = -1;
    }
    for(; m; m--){
        cin>> x >> y;
        r1 = rad(x);
        r2 = rad(y);
        if(r1 != r2){
           // v[x].push_back(y);
            //v[y].push_back(x);
            if(r[r1] < r[r2]){
                r[r1] += r[r2];
                r[r2] = r1;
               // dfs(y, x);
                ok[y] = 0;
            }
            else{
                r[r2] += r[r1];
                r[r1] = r2;
                //dfs(x, y);
                ok[x] = 0;
            }
        }
        else{
           /* while(x != y){
                if(niv[x] > niv[y]){
                    ok[x] = 1;
                    x = urm(x);
                }
                else{
                    ok[y] = 1;
                    y = urm(y);
                }
            }*/
        }
    }
    for(i = 1; i <= n; i++){
        if(ok[i] == 0 && t[i] != 0){
            cout<< i <<" "<< t[i] <<"\n";
        }
    }
}

Compilation message

pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:29:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v[nod].size(); i++){
                    ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 3320 KB Output is correct
2 Incorrect 419 ms 3192 KB Wrong number of edges

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1536 ms 3320 KB Output is correct
2 Incorrect 1375 ms 3192 KB Wrong number of edges

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3293 ms 3504 KB Output is correct
2 Incorrect 3108 ms 3540 KB Wrong number of edges

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4147 ms 3576 KB Output is correct
2 Incorrect 3928 ms 3448 KB Wrong number of edges

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5043 ms 3476 KB Time limit exceeded
2 Halted 0 ms 0 KB -