Submission #731336

#	Time	Username	Problem	Language	Result	Execution time	Memory
731336		esomer	Pipes (CEOI15_pipes)	C++17	20 / 100	1000 ms	65536 KiB

pipes

#include<bits/stdc++.h>
 
using namespace std;
 
#define endl "\n"

typedef long long int ll;
 
const int MOD = 1e9 + 7;

int cnt = 1;

int DFS(int x, vector<vector<pair<int, int>>>& adj, vector<int>& vis, int edge){
	vis[x] = cnt; int mn = cnt; cnt++;
	for(pair<int, int> pr : adj[x]){
		int node = pr.first;
		if(pr.second == edge) continue;
		if(vis[node] > 0){
			mn = min(mn, vis[node]);
		}else{
			int val = DFS(node, adj, vis, pr.second);
			mn = min(mn, val);
			if(val > vis[x]){
				cout << node + 1 << " " << x + 1 << endl;
			}
		}
	}
	return mn;
}

void solve(){
	int n, m; cin >> n >> m;
	vector<vector<pair<int, int>>> adj(n);
	for(int i = 0; i < m; i++){
		int u, v; cin >> u >> v; u--; v--;
		adj[u].push_back({v, i}); adj[v].push_back({u, i});
	}
	vector<int> vis(n, 0);
	for(int i = 0; i < n; i++){
		if(!vis[i]){
			DFS(i, adj, vis, -1);
		}
	}
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    //~ int tt; cin >> tt;
    int tt = 1;
    for(int t = 1; t <= tt; t++){
        solve();
    }
}

• 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