Submission #46365

#	Time	Username	Problem	Language	Result	Execution time	Memory
46365		sorry_Benq	Pipes (CEOI15_pipes)	C++17	10 / 100	5095 ms	65536 KiB

pipes

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

int n; // number of nodes
vector<vector<int>> adj; // adjacency list of graph

vector<bool> visited;
vector<int> tin, fup;
int timer;

void dfs(int v, int p = -1) {
    visited[v] = true;
    tin[v] = fup[v] = timer++;
    for (int to : adj[v]) {
        if (to == p) continue;
        if (visited[to]) {
            fup[v] = min(fup[v], tin[to]);
        } else {
            dfs(to, v);
            fup[v] = min(fup[v], fup[to]);
            if (fup[to] > tin[v])
                cout << v + 1 << ' ' << to + 1 << endl;
        }
    }
}

void find_bridges() {
    timer = 0;
    visited.assign(n, false);
    tin.assign(n, -1);
    fup.assign(n, -1);
    for (int i = 0; i < n; ++i) {
        if (!visited[i])
            dfs(i);
    }
}

int main(){
	cin >> n; int M; cin >> M;
	adj.resize(n);
	for (int i = 0; i < M; i++){
		int u, v; cin >> u >> v;
		u--; v--; adj[u].push_back(v); adj[v].push_back(u);
	}
	find_bridges();
}

• 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