제출 #1224371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224371		Amaarsaa	Pipes (CEOI15_pipes)	C++20	20 / 100	2487 ms	131072 KiB

pipes

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const ll N = 1e5 + 2;

ll tin[N], low[N];
ll timer = 0;
vector < ll > adj[N];

void dfs(ll node, ll par) {
	timer ++;
	low[node] = tin[node] = timer;
	
	bool found_dad = 0;
	for ( ll X : adj[node]) {
		if ( found_dad == 0 && X == par) {
			found_dad = 1;
			continue;
		}
		if ( tin[X] == 0) {
			dfs(X, node);
			low[node] = min(low[node], low[X]);
			if ( low[X] > tin[node]) {
				cout << node << " " << X << endl;
			}
		}
		else {
			low[node]= min(low[node], low[X]);
		}
	}
}

int main() {
	ll n, m, r, x, y, i, j, ans, t;
	
	cin >> n >> m;
	
	for (i = 1; i <= m; i ++) {
		cin >> x >> y;
		adj[x].push_back(y);
		adj[y].push_back(x);
	}	
	
	for (i = 1; i <= n; i++) {
		if ( tin[i] == 0) {
			dfs(i, 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