# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
527260 |
2022-02-17T04:26:10 Z |
joelau |
Pipes (CEOI15_pipes) |
C++14 |
|
878 ms |
65540 KB |
#include <bits/stdc++.h>
using namespace std;
int N,M, depth[100005], low[100005], p[100005];
vector< pair<int,int> > lst[100005];
bitset<100005> visited;
void dfs (int u, int d) {
visited[u] = 1, depth[u] = d, low[u] = d;
int num = 0;
for (auto v: lst[u]) {
if (!visited[v.first]) {
p[v.first] = v.second, num++;
dfs(v.first,d+1);
if (low[v.first] > depth[u]) cout << u+1 << ' ' << v.first+1 << '\n';
low[u] = min(low[u],low[v.first]);
}
else if (v.second != p[u])
low[u] = min(low[u],depth[v.first]);
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int u,v; cin>> u >> v; u--, v--;
lst[u].emplace_back(v,i), lst[v].emplace_back(u,i);
}
for (int i = 0; i < N; ++i) if (!visited[i]) dfs(i,0);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
1 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
3404 KB |
Output is correct |
2 |
Correct |
5 ms |
3128 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
116 ms |
18644 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
273 ms |
24900 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
372 ms |
45332 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
639 ms |
52856 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
855 ms |
65540 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
878 ms |
65540 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
849 ms |
65540 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
869 ms |
65540 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |