Submission #527259

#	Time	Username	Problem	Language	Result	Execution time	Memory
527259		joelau	Pipes (CEOI15_pipes)	C++14	20 / 100	1006 ms	65540 KiB

pipes

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

int N,M, depth[100005], low[100005], p[100005];
vector<int> lst[100005];
bitset<100005> visited;
map< pair<int,int>, int> mp;

void dfs (int u, int d) {
    visited[u] = 1, depth[u] = d, low[u] = d;
    int num = 0;
    for (int v: lst[u]) {
        if (!visited[v]) {
            p[v] = u, num++;
            dfs(v,d+1);
            if (low[v] > depth[u] && mp[make_pair(min(u,v),max(u,v))] == 1) cout << u+1 << ' ' << v+1 << '\n';
            low[u] = min(low[u],low[v]);
        }
        else if (v != p[u])
            low[u] = min(low[u],depth[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);
        mp[make_pair(min(u,v),max(u,v))]++;
    }
    for (int i = 0; i < N; ++i) if (!visited[i]) dfs(i,0);

    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