oj.uz

Submission #478966

# Submission time Handle Problem Language Result Execution time Memory
478966 2021-10-09T09:16:09 Z hjc4vr Pipes (CEOI15_pipes) C++14
30 / 100
 1935 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
int ufds1[100005],ufds2[100005],low[100005],depths[100005];
vector<int> adj[100005];
int find(int a,int par[]){
    if (par[a]==a) return a;
    par[a] = find(par[a],par);
    return par[a];
}

void dfs(int cur,int par){
    depths[cur] = depths[par] + 1;
    low[cur] = depths[cur];
    bool check= false;
    for (auto it: adj[cur]){
        if (check == 0 && it==par){
            check = true;
        }
        else{
        if (depths[it]==-1){
            dfs(it,cur);
            low[cur] = min(low[cur],low[it]);
            if (low[it]>depths[cur]){
                cout << cur << ' ' << it << '\n';
            }
        }else{
            low[cur] = min(low[cur],depths[it]);
            }
        }
    }
}


int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m;cin>>n>>m;
    fill(depths,depths+100005,-1);
    for (int i=1;i<=n;++i){
        ufds1[i] = i;
        ufds2[i] = i;
    }
    for (int i=0;i<m;++i){
        int a,b;cin>>a>>b;
        int pa = find(a,ufds1), pb = find(b,ufds2);
        if (pa!=pb){
            adj[a].push_back(b);
            adj[b].push_back(a);
            ufds1[pb] = pa;
        }else{ // it is a back edge
            int ba = find(a,ufds2), bb = find(b,ufds2);
            if (ba!=bb){
                adj[a].push_back(b);
                adj[b].push_back(a);
                ufds2[bb] = ba;
            }
        }
    }
    for (int i=1;i<=n;++i){
        if (depths[i]==-1){
            dfs(i,i);
        }
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3648 KB Output is correct
2 Correct 5 ms 3284 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 11308 KB Output is correct
2 Correct 110 ms 10620 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 15008 KB Output is correct
2 Runtime error 281 ms 19108 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 391 ms 26064 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 629 ms 33076 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1082 ms 55120 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1474 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1757 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1935 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -