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>
#define X first
#define Y second
using namespace std;
typedef long long llint;
const int maxn = 1e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 18;
const int off = 1 << logo;
const int treesiz = off << 1;
struct union_find {
int parr[maxn];
union_find() {
for (int i = 0; i < maxn; i++) parr[i] = i;
}
int fin(int x) {
if (x == parr[x]) return x;
return parr[x] = fin(parr[x]);
}
void merg(int a, int b) {
a = fin(a);
b = fin(b);
if (a == b) return;
int ra = rand() % 2;
if (ra == 0) parr[b] = a;
else parr[a] = b;
}
};
int n, m;
vector< int > graph[maxn];
union_find p, q;
int t = 0;
int dis[maxn], lo[maxn];
void dfs(int x, int parr) {
dis[x] = t++;
lo[x] = dis[x];
//printf("start %d %d\n", x, dis[x]);
for (int tren : graph[x]) {
if (tren == parr) continue;
if (dis[tren] == -1) {
dfs(tren, x);
if (lo[tren] > dis[x]) printf("%d %d\n", x, tren);
lo[x] = min(lo[x], lo[tren]);
} else {
lo[x] = min(lo[x], dis[tren]);
}
}
//printf("end %d: %d %d\n", x, dis[x], lo[x]);
}
int main() {
srand(time(0));
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
if (q.fin(a) != q.fin(b)) {
//printf("%d %d\n", a, b);
graph[a].push_back(b);
graph[b].push_back(a);
if (p.fin(a) != p.fin(b)) p.merg(a, b);
else q.merg(a, b);
}
}
memset(dis, -1, sizeof dis);
for (int i = 1; i <= n; i++) {
if (dis[i] == -1) dfs(i, 0);
}
return 0;
}
Compilation message (stderr)
pipes.cpp: In function 'int main()':
pipes.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | scanf("%d%d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | scanf("%d%d", &a, &b);
| ~~~~~^~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |