# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
475242 |
2021-09-21T15:32:05 Z |
stefantaga |
Pipes (CEOI15_pipes) |
C++14 |
|
1628 ms |
44176 KB |
#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]);
bool flag = false;
for (int tren : graph[x]) {
if (tren == parr && !flag) {
flag = true;
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 (p.fin(a) != p.fin(b)) {
graph[a].push_back(b);
graph[b].push_back(a);
p.merg(a, b);
} else if (q.fin(a) != q.fin(b)) {
graph[a].push_back(b);
graph[b].push_back(a);
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
pipes.cpp: In function 'int main()':
pipes.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
69 | scanf("%d%d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~
pipes.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
72 | scanf("%d%d", &a, &b);
| ~~~~~^~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
3788 KB |
Output is correct |
2 |
Correct |
3 ms |
3820 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
4340 KB |
Output is correct |
2 |
Correct |
7 ms |
4044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
142 ms |
9568 KB |
Output is correct |
2 |
Correct |
137 ms |
9296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
229 ms |
14304 KB |
Output is correct |
2 |
Correct |
273 ms |
15576 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
415 ms |
22288 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
558 ms |
31604 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
819 ms |
22548 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1089 ms |
27860 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1344 ms |
31588 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1628 ms |
44176 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |