# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
948379 |
2024-03-18T05:05:44 Z |
vjudge1 |
Pipes (CEOI15_pipes) |
C++17 |
|
93 ms |
24848 KB |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()
template<class S, class T>
bool chmin(S &a, const T &b) {
return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
return a < b ? (a = b) == b : false;
}
const int N = 5000;
vector<pair<int, int>> g[N];
bool vis[N];
int tin[N], fup[N], timer;
vector<int> bridges;
void dfs(int v, int p = -1, int idx = -1) {
vis[v] = true;
tin[v] = fup[v] = ++timer;
for (auto [to, new_idx] : g[v]) {
if (idx == new_idx) continue;
else if (vis[to]) chmin(fup[v], tin[to]);
else {
dfs(to, v, new_idx);
chmin(fup[v], fup[to]);
if (fup[to] > tin[v]) {
bridges.push_back(new_idx);
}
}
}
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, m; cin >> n >> m;
vector<pair<int, int>> vec;
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b;
a--, b--;
g[a].push_back({b, i});
g[b].push_back({a, i});
vec.push_back({min(a, b), max(a, b)});
}
for (int i = 0; i < n; ++i) {
if (!vis[i]) dfs(i);
}
for (auto i : bridges) {
cout << vec[i].first + 1 << ' ' << vec[i].second + 1 << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1116 KB |
Output is correct |
2 |
Correct |
3 ms |
860 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
93 ms |
24848 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
616 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |