제출 #715708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715708		stevancv	Pipes (CEOI15_pipes)	C++14	20 / 100	743 ms	65536 KiB

pipes

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const int inf = 1e9;
vector<pair<int, int>> g[N];
int dep[N];
vector<int> ans;
int Dfs(int s, int e) {
    int d = dep[s];
    for (auto u : g[s]) {
        if (u.second == e) continue;
        int v = u.first;
        if (dep[v] == inf) {
            dep[v] = dep[s] + 1;
            int x = Dfs(v, u.second);
            if (x == dep[v]) ans.push_back(u.second);
            else smin(d, x);
        }
        else smin(d, dep[v]);
    }
    return d;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> u(m), v(m);
    for (int i = 0; i < m; i++) {
        cin >> u[i] >> v[i];
        g[u[i]].push_back({v[i], i});
        g[v[i]].push_back({u[i], i});
    }
    for (int i = 1; i <= n; i++) dep[i] = inf;
    for (int i = 1; i <= n; i++) {
        if (dep[i] == inf) {
            dep[i] = 0;
            Dfs(i, -1);
        }
    }
    for (int i : ans) cout << u[i] << sp << v[i] << en;
    return 0;
}

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