제출 #851495

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
851495		Nhoksocqt1	Pipes (CEOI15_pipes)	C++17	100 / 100	753 ms	14224 KiB

pipes

#include<bits/stdc++.h>
using namespace std;

const int MAXN = 100005;

vector<int> adj[MAXN];
int lab[MAXN][2];

int root(int it, int u) {
    return (lab[u][it] == u) ? u : (lab[u][it] = root(it, lab[u][it]));
}

void dfs(int u, int p) {
    lab[u][0] = lab[u][1] = ++lab[0][0];

    bool edgep(1);
    for (int v : adj[u]) {
        if(v == p && edgep) {
            edgep = 0;
            continue;
        }

        if(!lab[v][1]) {
            dfs(v, u);
            lab[u][0] = min(lab[u][0], lab[v][0]);
            if(lab[v][0] >= lab[v][1])
                cout << u << ' ' << v << '\n';
        } else {
            lab[u][0] = min(lab[u][0], lab[v][1]);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int numNode, numEdge;
    cin >> numNode >> numEdge;
    for (int i = 1; i <= numNode; ++i)
        lab[i][0] = lab[i][1] = i;

    for (int i = 0; i < numEdge; ++i) {
        int u, v;
        cin >> u >> v;
        if(root(0, u) != root(0, v)) {
            lab[lab[u][0]][0] = lab[v][0];
            adj[u].push_back(v);
            adj[v].push_back(u);
        } else
            if(root(1, u) != root(1, v)) {
                lab[lab[u][1]][1] = lab[v][1];
                adj[u].push_back(v);
                adj[v].push_back(u);
            }
    }

    for (int i = 0; i <= numNode; ++i)
        lab[i][0] = lab[i][1] = 0;

    for (int i = 1; i <= numNode; ++i) {
        if(!lab[i][1])
            dfs(i, -1);
    }

    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