제출 #839675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839675		kyaruru	Pipes (CEOI15_pipes)	C++17	0 / 100	815 ms	59872 KiB

pipes

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

vector<int> uf1(100001),uf2(100001),tin(100001,-1),low(100001,-1);
vector<int> adj[100001];
bool vi[100001];
int t=0;

int find(int x,int p) {
    if(p==1){
        if (x == uf1[x]) return x;
        else return uf1[x] = find(uf1[x],p);
    }else{
        if (x == uf2[x]) return x;
        else return uf2[x] = find(uf2[x],p);
    }
}

void unite(int x, int y,int p){
    x = find(x,p);
    y = find(y,p);
    if(p==1) uf1[x] = y;
    else uf2[x] = y;
}

void dfs(int x,int p=-1){
    vi[x]=true;
    tin[x]=low[x]=t++;
    for(int u:adj[x]){
        if(p==u) continue;
        if(vi[u]) low[x]=min(low[x],tin[u]);
        else{
            dfs(u,x);
            low[x]=min(low[x],low[u]);
            if(low[u]>tin[x]) cout<<x<<" "<<u<<"\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    iota(uf1.begin(),uf1.end(),0);
    iota(uf2.begin(),uf2.end(),0);

    int a,b;
    cin>>a>>b;

    for(int i=0; i<b; i++){
        int x,y;
        cin>>x>>y;
        if(find(x,1)!=find(y,1)){
            unite(x,y,1);
            adj[x].push_back(y);
            adj[y].push_back(x);
        }
        else if(find(x,2)!=find(y,2)){
            unite(x,y,2);
            adj[x].push_back(y);
            adj[y].push_back(x);
        }
    }
    for(int i=1; i<=a; i++){
        if(!vi[i]) dfs(i);
    }
}

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