제출 #1266156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266156		PlayVoltz	Pipes (CEOI15_pipes)	C++20	30 / 100	1662 ms	94448 KiB

pipes

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

#define pii pair<int, int>
#define mp make_pair
#define pb push_back

int counter=0;
vector<vector<int> > graph;
vector<int> low, disc;

void dfs(int node, int par){
	disc[node]=low[node]=counter++;
	bool done=false;
	for (auto num:graph[node]){
		if (disc[num]==-1){
			dfs(num, node);
			low[node]=min(low[node], low[num]);
			if (low[num]>disc[node])cout<<node+1<<" "<<num+1<<"\n";
		}
		else if (num==par && !done)done=1;
		else low[node]=min(low[node], disc[num]);
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m, a, b;
	cin>>n>>m;
	graph.resize(n);
	disc.resize(n, -1);
	low.resize(n);
	while (m--){
		cin>>a>>b;--a;--b;
		graph[a].pb(b);
		graph[b].pb(a);
	}
	for (int i=0; i<n; ++i)if (disc[i]==-1)dfs(i, -1);
}

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