제출 #1260996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1260996		antonn	Pipes (CEOI15_pipes)	C++20	10 / 100	1959 ms	97524 KiB

pipes

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e5 + 7;

int n, m;
vector<int> g[N];
int low[N], tin[N];
bool vis[N];
int tt;

void dfs(int u, int p = -1) {
    vis[u] = 1;
    tin[u] = ++tt;
    low[u] = tin[u]; 
    for (auto v : g[u]) {
        if (v == p) continue;
        if (vis[v]) {
            low[u] = min(low[u], tin[v]);
        } else {
            dfs(v, u);
            low[u] = min(low[u], low[v]);
            if (low[v] > tin[u]) cout << u << " " << v << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for (int i = 1; i <= n; ++i) if (!vis[i]) dfs(i);
    return 0;
}

• 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