oj.uz

Submission #106608

# Submission time Handle Problem Language Result Execution time Memory
106608 2019-04-19T08:30:54 Z teomrn Pipes (CEOI15_pipes) C++14
100 / 100
 1225 ms 14048 KB 
/// official solution.
/// just to see if mine is broken or the judge has memory problems


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=100010, inf=2e9;
 
 
int n, m;
int U[2][MX];
 
vector<int> G[MX];
 
int find(int t, int x){
    return x==U[t][x] ? x : U[t][x]=find(t,U[t][x]);
}
void unite(int t, int x, int y){
    if(find(t,x)==find(t,y)) return;
    U[t][U[t][y]]=U[t][x];
}
 
int up[MX], dep[MX], now;
void dfs(int v, int p){
    dep[v]=++now; up[v]=dep[v];
    bool multi=false;
    for(int x:G[v]){
        if(x==p){
            if(multi) up[v]=min(up[v], dep[p]);
            multi=true;
            continue;
        }
        if(dep[x]>0) up[v]=min(up[v], dep[x]);
        else{
            dfs(x,v);
            up[v]=min(up[v], up[x]);
            if(up[x]>dep[v]) cout<<v<<' '<<x<<'\n';
        }
    }
    now--;
}
 
int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for(int i=1; i<=n; i++) U[0][i]=U[1][i]=i;
    for(int i=1; i<=m; i++){
        int u, v; cin>>u>>v;
        if(find(0,u)==find(0,v)){
            if(find(1,u)==find(1,v)) continue;
            unite(1,u,v);
        }
        else unite(0,u,v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    for(int i=1; i<=n; i++)
        if(dep[i]==0) dfs(i,-1);
    return 0;
}

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 7 ms 3200 KB Output is correct
2 Correct 8 ms 3116 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 3064 KB Output is correct
2 Correct 99 ms 2944 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 3728 KB Output is correct
2 Correct 193 ms 3320 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 5424 KB Output is correct
2 Correct 255 ms 5084 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 10592 KB Output is correct
2 Correct 378 ms 7160 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 714 ms 11868 KB Output is correct
2 Correct 643 ms 9052 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 910 ms 14040 KB Output is correct
2 Correct 781 ms 9112 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1033 ms 14048 KB Output is correct
2 Correct 982 ms 9140 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1203 ms 13416 KB Output is correct
2 Correct 1225 ms 10968 KB Output is correct