Submission #948542

#	Time	Username	Problem	Language	Result	Execution time	Memory
948542		vjudge1	Pipes (CEOI15_pipes)	C++17	20 / 100	95 ms	16464 KiB

pipes

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 5000;

vector<pair<int,int>> g[N];

vector<int> tin(N), low(N);

void dfs(int v, int p, vector<bool>& vis, int& timer) {
    vis[v] = true;
    tin[v] = low[v] = timer++;
    for (auto [to, check] : g[v]) {
        if (check == p)
            continue;
        if(vis[to]){
			low[v] = min(low[v], low[to]);
		} else{
			dfs(to, check, vis, timer);
			low[v] = min(low[v], low[to]);
			if (low[to] > tin[v])
				cout << v << " " << to << "\n";	
		}
        
    }
}

void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        g[a].emplace_back(b, i);
        g[b].emplace_back(a, i);
    }
    vector<bool> vis(n, false);
    int timer = 0;
    for(int i = 0; i < n; i++){
        if(!vis[i]){
            dfs(i, -1, vis, timer);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    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