제출 #527167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527167		joelau	Pipes (CEOI15_pipes)	C++14	10 / 100	1719 ms	65540 KiB

pipes

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

int N,M, num[100005], low[100005], p[100005], cnt = 0;
vector<int> lst[100005];

void dfs (int u) {
    low[u] = num[u] = cnt++;
    for (int v: lst[u]) {
        if (num[v] == -1) {
            p[v] = u;
            dfs(v);
            if (low[v] > num[u])
                cout << u+1 << ' ' << v+1 << '\n';
            low[u] = min(low[u],low[v]);
        }
        else if (v != p[u])
            low[u] = min(low[u],num[v]);
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> M;
    for (int i = 0; i < M; ++i) {
        int u,v; cin>> u >> v; u--, v--;
        lst[u].push_back(v), lst[v].push_back(u);
    }
    memset(num,-1,sizeof(num));
    for (int i = 0; i < N; ++i) if (num[i] == -1) 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