oj.uz

Submission #550203

# Submission time Handle Problem Language Result Execution time Memory
550203 2022-04-17T14:35:01 Z leaked Pipes (CEOI15_pipes) C++17
60 / 100
 1215 ms 52532 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define vec vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pw(x) (1LL<<(x))
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
const int N=1e5+1;
vec<pii> g[N];
int fup[N],in[N],tt=2;
struct dsu{
    int p[N];
    dsu(){
        iota(p,p+N,0);
    }
    int get(int v){
        return p[v]=(p[v]==v?v:get(p[v]));
    }
    bool mg(int a,int b){
        a=get(a),b=get(b);
        if(a==b) return 0;
        p[a]=b;
        return 1;
    }
}x,y;
void dfs(int v,int p){
    fup[v]=in[v]=tt++;
    for(auto &z : g[v]){
        if(z.s==p) continue;
        if(in[z.f]) fup[v]=(fup[v]<in[z.f]?fup[v]:in[z.f]);
        else{
            dfs(z.f,z.s);
            fup[v]=(fup[v]<fup[z.f]?fup[v]:fup[z.f]);
            if(fup[z.f]>in[v]){
                cout<<v+1<<' '<<z.f+1<<'\n';
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m;
    int v,u;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>v>>u;--v;--u;
        if(x.mg(v,u) || y.mg(v,u)){
            g[v].pb({u,i});g[u].pb({v,i});
        }
    }
    for(int i=0;i<n;i++){
        if(!in[i])
            dfs(i,i);
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 4180 KB Output is correct
2 Correct 92 ms 3856 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 5068 KB Output is correct
2 Correct 181 ms 4412 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 6712 KB Output is correct
2 Correct 221 ms 6704 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 12644 KB Output is correct
2 Correct 330 ms 8720 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 603 ms 13928 KB Output is correct
2 Runtime error 620 ms 43148 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 826 ms 16044 KB Output is correct
2 Runtime error 799 ms 52532 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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