# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
958988 |
2024-04-07T10:54:18 Z |
Cyber_Wolf |
Pipes (CEOI15_pipes) |
C++17 |
|
1297 ms |
65536 KB |
#include <bits/stdc++.h>
using namespace std;
#define lg int
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const lg N = 1e5+5;
vector<lg> adj[N];
lg n,m, low[N], tin[N], tmp, id;
set<array<lg, 2>> se;
void dfs(lg src, lg par = -1)
{
tin[src] = low[src] = ++tmp;
for(auto it : adj[src])
{
if(it == par)
{
continue;
}
if(tin[it])
{
if(low[it] > tin[src])
{
if(se.find({it, src}) != se.end()) se.erase({it, src});
}
low[src] = min(low[src], tin[it]);
continue;
}
dfs(it, src);
low[src] = min(low[src], low[it]);
if(low[it] > tin[src])
{
se.insert({it, src});
}
}
// cout << src << ' ' << low[src] << '\n';
}
int main()
{
fastio;
cin >> n >> m;
for(int i = 0; i < m; i++)
{
lg u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i = 1; i <= n; i++)
{
if(!tin[i]) dfs(i);
}
for(auto [a, b] : se) cout << a << ' ' << b << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3420 KB |
Output is correct |
2 |
Correct |
1 ms |
3420 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
3932 KB |
Output is correct |
2 |
Correct |
3 ms |
3676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
78 ms |
11492 KB |
Output is correct |
2 |
Correct |
74 ms |
10836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
151 ms |
14932 KB |
Output is correct |
2 |
Runtime error |
174 ms |
19544 KB |
Memory limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
254 ms |
26196 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
432 ms |
32596 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
680 ms |
54872 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
915 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1221 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1297 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |