# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
246243 |
2020-07-08T12:30:51 Z |
dantoh000 |
Pipes (CEOI15_pipes) |
C++14 |
|
2844 ms |
65540 KB |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
const int N = 100005;
int n,m;
vector<int> G[N];
vector<ii> bad;
int p[N], d[N], sz[N], h[N], pos[N], S[N];
int ct = 1;
void dfs(int u){
sz[u] = 1;
for (auto v : G[u]){
if (p[v] == 0){
p[v] = u;
d[v] = d[u]+1;
dfs(v);
sz[u] += sz[v];
}
else{
if (p[u] == v) continue;
else{
bad.push_back({u,v});
}
}
}
}
void decomp(int u){
pos[u] = ct++;
//printf("%d %d\n",u,ct);
int heavy = 0;
for (auto v : G[u]){
if (p[v] != u) continue;
if (sz[heavy] < sz[v]) heavy = v;
}
if (heavy == 0) return;
h[heavy] = h[u];
decomp(heavy);
for (auto v : G[u]){
if (p[v] != u) continue;
if (v != heavy && v != p[u]) decomp(v);
}
}
void up(int u, int v){
while (h[u] != h[v]){
if (u == -1 || v == -1) return;
if (d[h[u]] > d[h[v]]) swap(u,v);
//printf("updating %d to %d\n",v,h[v]);
S[pos[h[v]]]++;
S[pos[v]+1]--;
v = p[h[v]];
}
if (d[u] > d[v]) swap(u,v);
S[pos[u]+1]++;
S[pos[v]+1]--;
}
int main(){
scanf("%d%d",&n,&m);
for (int i = 0; i < m; i++){
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
iota(h,h+N,0);
for (int i = 1; i <= n; i++){
if (p[i] == 0){
p[i] = -1;
dfs(i);
decomp(i);
}
for (auto X : bad){
int u,v;
tie(u,v) = X;
//printf("%d %d bad\n",u,v);
up(u,v);
}
bad.clear();
}
for (int i = 1; i <= n; i++){
S[i] += S[i-1];
}
for (int i = 1; i <= n; i++){
//printf("edge<%d %d> = %d\n",i,p[i],S[pos[i]]);
if (S[pos[i]] == 0 && p[i] != -1){
printf("%d %d\n",p[i],i);
}
}
}
Compilation message
pipes.cpp: In function 'int main()':
pipes.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
~~~~~^~~~~~~~~~~~~~
pipes.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
~~~~~^~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
3072 KB |
Output is correct |
2 |
Incorrect |
6 ms |
3072 KB |
Wrong number of edges |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
3840 KB |
Output is correct |
2 |
Correct |
12 ms |
3712 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
236 ms |
28628 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
438 ms |
31956 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
769 ms |
61224 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1211 ms |
65536 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1670 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2160 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2612 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2844 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |