# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97153 | dndhk | Pipes (CEOI15_pipes) | C++14 | 1641 ms | 8436 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 <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>
#define MAX_N 100000
using namespace std;
int N, M;
pair<int, int> gp[MAX_N*4+1];
int sz = 0;
int g1[MAX_N+1], g2[MAX_N+1];
int up[MAX_N+1], lv[MAX_N+1], p[MAX_N+1];
vector<int> v;
int find_g1(int x){
while(x!=g1[x]){
v.push_back(x);
x = g1[x];
}
while(!v.empty()){
g1[v.back()] = x;
v.pop_back();
}
return x;
}
int find_g2(int x){
if(x==g2[x]) return x;
return g2[x] = find_g2(g2[x]);
}
int s, e, m;
void dfs(int x){
bool tf = true;
up[x] = lv[x];
s = 0, e = sz-1;
while(s<e){
m = (s+e)/2;
if(gp[m].first<x) s = m+1;
else e = m;
}
for(int i=s; i<sz; i++){
if(gp[i].first!=x) break;
if(gp[i].second==p[x] && tf){
tf = false; continue;
}
if(lv[gp[i].second]!=0){
up[x] = min(up[x], lv[gp[i].second]);
}else{
p[gp[i].second] = x;
lv[gp[i].second] = lv[x]+1;
dfs(gp[i].second);
if(up[gp[i].second]>lv[x]) printf("%d %d\n", gp[i].second, x);
up[x] = min(up[x], up[gp[i].second]);
}
}
}
int main(){
scanf("%d %d", &N, &M);
for(int i=1; i<=N; i++) g1[i] = g2[i] = i;
int a, b, A, B;
while(M--){
scanf("%d%d", &a, &b);
A = a;
while(g1[A]!=A){
v.push_back(A); A = g1[A];
}
while(!v.empty()){
g1[v.back()] = A; v.pop_back();
}
B = b;
while(g1[B]!=B){
v.push_back(B); B = g1[B];
}
while(!v.empty()){
g1[v.back()] = B; v.pop_back();
}
if(A!=B){
gp[sz++] = {a, b}; gp[sz++] = {b, a};
g1[A] = B;
continue;
}
A = a; B = b;
while(g2[A]!=A){
v.push_back(A); A = g2[A];
}
while(!v.empty()){
g2[v.back()] = A; v.pop_back();
}
while(g2[B]!=B){
v.push_back(B); B = g2[B];
}
while(!v.empty()){
g2[v.back()] = B; v.pop_back();
}
if(A!=B){
gp[sz++] = {a, b}; gp[sz++] = {b, a};;
g2[A] = B;
}
}sort(gp, gp+sz);
for(int i=1; i<=N; i++){
if(lv[i]==0){
lv[i] = 1;
dfs(i);
}
}
return 0;
}
Compilation message (stderr)
# | 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... |