# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527265 | 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;
const int MAXN = 100005;
int* depth;
int* low;
int* pos = new int[MAXN];
int* edgelist;
void AP(int i, int d, int pa) {
depth[i] = d; low[i] = d;
int paedges = 0;
for (int k = pos[i]; k < pos[i+1]; k++) {
ch = edgelist[k];
if (ch==pa) {
paedges++;
continue;
}
if (depth[ch] != UINT16_MAX) {
low[i] = min(low[i], depth[ch]);
} else {
AP(ch, d+1, i);
low[i] = min(low[i], low[ch]);
}
}
if (pa==-1) return;
if (low[i] > depth[pa] && paedges == 1) {
cout << i+1 << " " << pa+1 << "\n";
}
}
int main() {
int N, M, a, b; cin >> N >> M;
vector<pair<int, int> > EL(2*M, {0, 0});
for (int i = 0; i < M; i++) {
cin >> a >> b;
EL[2*i] = {a,b};
EL[2*i+1] = {b,a};
}
sort(EL.begin(), EL.end());
int curri = -1;
int ptr = 0;
int q = 0;
edgelist = new int[2*M+5];
for (auto a : EL) {
if (a.first != curri) {
pos[ptr++] = q;
curri = a.first;
}
edgelist[q] = a.second;
q++;
}
vector<int>().swap(EL);
}