제출 #1168642

#제출 시각아이디문제언어결과실행 시간메모리
1168642domblyPipes (CEOI15_pipes)C++20
10 / 100
1083 ms93288 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; bool was[N]; int in[N], timer = 0, low[N]; vector<int> g[N]; void Dfs(int x, int p) { was[x] = true; low[x] = in[x] = ++timer; for(int j : g[x]) { if(j != p) { if(was[j]) low[x] = min(low[x], in[j]); else { Dfs(j, x); low[x] = min(low[x], low[j]); if(in[x] < low[j]) cout << x << " " << j << "\n"; } } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; for(int i = 1; i <= m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } for(int i = 1; i <= n; i++) if(!was[i]) Dfs(i, 0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...