제출 #382566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382566		Mahdi_Shokoufi	Pipes (CEOI15_pipes)	C++17	100 / 100	1395 ms	14444 KiB

pipes

//In the name of Allah
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

const int N = 1e5 + 10;

int par[2][N], mark[N], t;
vector < int > adj[N];

int getPar(int v){
    return par[t][v] == v ? v : par[t][v] = getPar(par[t][v]);
}

bool merge(int u, int v){
    u = getPar(u); v = getPar(v);
    if (u == v)
        return false;
    par[t][u] = v;
    return true;
}

void DFS(int v, int p = 0){
    mark[v] = 1;
    par[1][v] = N;
    int cnt = 0;
    for (int u : adj[v]){
        if (u == p){
            cnt ++;
            continue;
        }
        if (mark[u])
            par[1][v] = min(par[1][v], par[0][u]);
        else{
            par[0][u] = par[0][v] + 1;
            DFS(u, v);
            par[1][v] = min(par[1][v], par[1][u]);
        }
    }
    if (p && cnt == 1 && par[0][p] < par[1][v])
        cout << p << ' ' << v << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < N; i ++)
        par[0][i] = par[1][i] = i;
    for (int i = 0; i < m; i ++){
        int u, v, f = 1;
        cin >> u >> v;
        t = 0;
        if (merge(u, v)){
            adj[u].pb(v);
            adj[v].pb(u);
            f = 0;
        }
        t = 1;
        if (f && merge(u, v)){
            adj[u].pb(v);
            adj[v].pb(u);
        }
    }
    memset(par, 0, sizeof par);
    for (int v = 1; v <= n; v ++)
        if (!mark[v])
            DFS(v);
    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: 10 / 10
• Subtask 10: 10 / 10