제출 #550206

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550206		leaked	Pipes (CEOI15_pipes)	C++17	80 / 100	1046 ms	63164 KiB

pipes

#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;
const int M=(N-1)*2;
vec<pii> g[N];
int ii[M],ij[M];
int siz[N],x[N],y[N],tt=2;
int get(int *p,int v){
    return (p[v]<0?v:p[v]=get(p,p[v]));
}
bool mg(int *p,int v,int u){
    v=get(p,v);u=get(p,u);
    if(v==u) return 0;
    if(p[v]<p[u]) swap(v,u);
    p[u]=v;--p[v];
    return 1;
}
void dfs(int v,int p){
    x[v]=y[v]=tt++;
    for(auto &z : g[v]){
        if(z.s==p) continue;
        if(x[z.f]) x[v]=(x[v]<y[z.f]?x[v]:y[z.f]);
        else{
            dfs(z.f,z.s);
            x[v]=(x[v]<x[z.f]?x[v]:x[z.f]);
//            cerr<<v<<' '<<z.f<<' '<<
            if(x[z.f]>y[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;
    fill(x,x+N,-1);fill(y,y+N,-1);
    for(int i=0;i<m;i++){
        cin>>v>>u;--v;--u;
        if(mg(x,v,u) || mg(y,v,u)){
            g[v].emplace_back(u,i);g[u].emplace_back(v,i);
        }
    }
    fill(x,x+N,0);fill(y,y+N,0);

    for(int i=0;i<n;i++){
        if(!x[i])
            dfs(i,i);
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10