제출 #1084675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1084675		SulA	Pipes (CEOI15_pipes)	C++17	10 / 100	1087 ms	65536 KiB

pipes

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

vector<int> adj[100000];
int dep[100000], low[100000];

void dfs(int v = 0, int p = 0) {
    low[v] = dep[v] = dep[p] + 1;
    for (int ch : adj[v]) {
        if (ch == p) continue;
        if (dep[ch] == 0) {
            dfs(ch, v);
            low[v] = min(low[v], low[ch]);
        } else {
            low[v] = min(low[v], dep[ch]);
        }
    }
    if (low[v] == dep[v] && v != p) {
        cout << v+1 << " " << p+1 << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int n,m; cin >> n >> m;
    while (m--) {
        int u,v; cin >> u >> v;
        adj[--u].push_back(--v);
        adj[v].push_back(u);
    }
    for (int i = 0; i < n; i++) if (dep[i] == 0) dfs(i, i);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 10 / 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