Submission #99651

#TimeUsernameProblemLanguageResultExecution timeMemory
99651adletPipes (CEOI15_pipes)C++17
10 / 100
5070 ms65236 KiB
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout) #define ios ios_base::sync_with_stdio(0), cin.tie(0) using namespace std; typedef long long ll; const int N = 1e5 + 5; const int mod = 1e9 + 7; const int INF = 1e9; const double PI = acos(-1.0); int n, m, cnt, timer, fup[N], used[N], tin[N]; vector < int > g[N]; 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]) { dfs(to, v); fup[v] = min(fup[v], fup[to]); if (fup[to] > tin[v]) cout << v << " " << to << "\n"; } else fup[v] = min(fup[v], tin[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); } } } /** clock() / (double)CLOCKS_PER_SEC < 1.9 */
#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...