oj.uz

Submission #1003087

# Submission time Handle Problem Language Result Execution time Memory
1003087 2024-06-20T05:52:34 Z Aiperiii Pipes (CEOI15_pipes) C++14
40 / 100
 1873 ms 65540 KB 
#include <bits/stdc++.h>
//#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
int p[2][N];
vector <int> g[N];
int find_set(int i,int v){
    if(p[i][v]==v)return v;
    return p[i][v]=find_set(i,p[i][v]);
}
bool union_set(int i,int u,int v){
    if(find_set(i,u)==find_set(i,v))return false;
    p[i][u]=v;
    return true;
}
int t=0,to;
void dfs(int v,int par){
    t++;
    p[0][v]=t;
    p[1][v]=t;
    bool ok=0;
    for(int to : g[v]){
        if(par==to && !ok)ok=1;
        else if(p[0][to])p[1][v]=min(p[1][v],p[0][to]);
        else{
            dfs(to,v);
            p[1][v]=min(p[1][v],p[1][to]);
            if(p[1][to]>p[0][v]){
                cout<<v<<" "<<to<<"\n";
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        p[0][i]=i;
        p[1][i]=i;
    }
    int u,v;
    for(int i=0;i<m;i++){
        cin>>u>>v;
        if(union_set(0,u,v)){
            g[u].pb(v);
            g[v].pb(u);
        }
        else if(union_set(1,u,v)){
            g[u].pb(v);
            g[v].pb(u);
        }
    }
    for(int i=0;i<=n;i++){
        p[0][i]=0;
        p[1][i]=0;
    }
    for(int i=1;i<=n;i++){
        if(!p[0][i])dfs(i,0);
    }
}
/*
 
 10 11
 1 7
 1 8
 1 6
 2 8
 6 7
 5 8
 2 5
 2 3
 2 4
 3 4
 10 9
 */

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3416 KB Output is correct
2 Correct 5 ms 3072 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 9124 KB Output is correct
2 Correct 135 ms 8532 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 14836 KB Output is correct
2 Correct 280 ms 15440 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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