oj.uz

Submission #550205

# Submission time Handle Problem Language Result Execution time Memory
550205 2022-04-17T14:42:15 Z leaked Pipes (CEOI15_pipes) C++17
70 / 100
 1183 ms 65536 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];
//array<int,2> e[2*N];
int fup[N],in[N],tt=2;
struct dsu{
    int p[N],sz[N];
    dsu(){
        iota(p,p+N,0);
        fill(sz,sz+N,1);
    }
    int get(int v){
        return p[v]=(p[v]==v?v:get(p[v]));
    }
    bool mg(int v,int u){
        v=get(v),u=get(u);
        if(v==u) return 0;
        if(sz[v]<sz[u]) swap(v,u);
        p[u]=v;sz[v]+=sz[u];
        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].emplace_back(u,i);g[u].emplace_back(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 3 ms 4180 KB Output is correct
2 Correct 2 ms 4240 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4820 KB Output is correct
2 Correct 7 ms 4564 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 5080 KB Output is correct
2 Correct 93 ms 4704 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 5868 KB Output is correct
2 Correct 198 ms 5192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 7700 KB Output is correct
2 Correct 231 ms 6900 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 13744 KB Output is correct
2 Correct 344 ms 9548 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 14964 KB Output is correct
2 Correct 540 ms 10704 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1126 ms 16264 KB Output is correct
2 Runtime error 1183 ms 65536 KB Memory limit exceeded
3 Halted 0 ms 0 KB -