Submission #99655

#TimeUsernameProblemLanguageResultExecution timeMemory
99655adletPipes (CEOI15_pipes)C++17
10 / 100
5081 ms64580 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, m, cnt, timer, fup[N], used[N], tin[N]; vector < int > g[N]; vector < pair < int, int > > ans; inline void dfs(int v, int p = -1) { used[v] = 1; tin[v] = ++timer; fup[v] = timer; for (int to : g[v]) { if (to == p) continue; if (used[to]) fup[v] = min(fup[v], tin[to]); else { dfs(to, v); fup[v] = min(fup[v], fup[to]); if (fup[to] > tin[v]) ans.push_back({v, to}); } } } int main() { cin >> n >> m; for (int i = 1; i <= m; ++i) { int v, u; cin >> v >> u; g[v].push_back(u); g[u].push_back(v); } for (int i = 1; i <= n; ++i) { if (!used[i]) { dfs(i); } } for (auto i : ans) cout << i.first << " " << i.second << "\n"; }
#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...