# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527132 | ecxx | Pipes (CEOI15_pipes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int uint16_t
int N;
vector<int> depth;
vector<int> low;
vector<vector<int> > AL;
void AP(int i, int d, int pa) {
int cc = 0;
depth[i] = d; low[i] = d;
bool art = false;
for (int ch : AL[i]) {
if (ch==pa) continue;
if (depth[ch] > -1) {
low[i] = min(low[i], depth[ch]);
} else {
AP(ch, d+1, i);
cc++;
if (low[ch] >= depth[i]) {
art = true;
}
low[i] = min(low[i], low[ch]);
}
}
if (low[i] == depth[i] && pa!=-1) {
cout << i+1 << " " << pa+1 << "\n";
}
}
int main() {
int N, M, a, b; cin >> N >> M;
depth.assign(N, -1);
low.assign(N, 0);
AL.assign(N, vector<int>());
for (int i = 0; i < M; i++) {
cin >> a >> b; a--;b--;
AL[a].push_back(b); AL[b].push_back(a);
}
for (int i = 0; i < N; i++) {
if (depth[i] == -1) AP(i,0,-1);
}
}