oj.uz

Submission #861391

# Submission time Handle Problem Language Result Execution time Memory
861391 2023-10-16T05:15:06 Z Faisal_Saqib Pipes (CEOI15_pipes) C++17
50 / 100
 812 ms 50364 KB 
#include <iostream>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <iomanip>
#include <vector>

using namespace std;

const int MAXN=1e5+1;
const int LG=17;
int** pa;
int *par,*h,*Up,*par1;
vector<int>* ma;
int get1(int& a)
{
	return ((par1[a]==a)?a:par1[a]=get1(par1[a]));
}
void join1(int a,int b)
{
	a=get1(a);
	b=get1(b);
	if(a!=b)
		par1[a]=b;
}
int get(int& a)
{
	return ((par[a]==a)?a:par[a]=get(par[a]));
}
bool join(int a,int b)
{
	a=get(a);
	b=get(b);
	if(a!=b)
	{
		par[a]=b;
		return 1;
	}
	return 0;
}
void dfs(int& x,int& p)
{
	// cout<<x<<' '<<p<<endl;
	pa[x][0]=p;
	for(int j=1;j<LG;j++)
		pa[x][j]=pa[pa[x][j-1]][j-1];
	h[x]=h[p]+1;
	for(auto y:ma[x])
		if(y!=p)
			dfs(y,x);
}
int lca(int x,int y)
{
	if(h[x]>h[y])
		swap(x,y);
	for(int j=LG-1;j>=0;j--)
		if(h[x]<=h[pa[y][j]])
			y=pa[y][j];
	if(x==y)
		return x;
	for(int j=LG-1;j>=0;j--)
		if(pa[x][j]!=pa[y][j])
		{
			x=pa[x][j];
			y=pa[y][j];
		}
	return pa[x][0];
}
void solve(int& x,int& p)
{
	for(auto y:ma[x])
	{
		if(y!=p)
		{
			solve(y,x);
		}
	}
	for(auto y:ma[x])
	{
		if(y!=p)
		{
			if(h[Up[x]]>h[Up[y]])
			{
				Up[x]=Up[y];
			}
			if(Up[y]==y)
			{
				cout<<x<<' '<<y<<endl;
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
    int n,m;
    cin>>n>>m;
    ma=new vector<int>[n+1];
	par=new int[n+1];
	par1=new int[n+1];
	h=new int[n+1];
	Up=new int[n+1];
	pa=new int*[n+1];
    for(int i=1;i<=n;i++)
    {
    	pa[i]=new int[LG];
    	par[i]=par1[i]=Up[i]=i;
    }
    for(int i=0;i<m;i++)
    {
    	int x,y;
    	cin>>x>>y;
    	if(join(x,y))
    	{
    		// cout<<"Tree Edge "<<x<<' '<<y<<endl;
    		ma[x].push_back(y);
    		ma[y].push_back(x);
    	}
    	else
    	{
    		// cout<<"Cycle Edge "<<x<<' '<<y<<endl;
    		join1(x,y);
    	}
    }
    // cout<<"Tree Input:\n";
    for(int i=1;i<=n;i++)
    	if(pa[i][0]==0)
		    dfs(i,i);
	// cout<<"Cycle Input:"<<endl;
    for(int y=1;y<=n;y++)
    {
    	int x=get1(y);
    	// cout<<y<<' '<<x<<endl;
    	int c=lca(x,y);
		if(h[Up[x]]>h[c])
		{
			Up[x]=c;
		}
		if(h[Up[y]]>h[c])
		{
			Up[y]=c; 
		}
    }
    // cout<<"Bridge Edges:\n";
    for(int i=1;i<=n;i++)
    	if(pa[i][0]==i)
		    solve(i,i);
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 448 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1116 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 4436 KB Output is correct
2 Correct 65 ms 4052 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 7256 KB Output is correct
2 Correct 141 ms 8352 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 13036 KB Output is correct
2 Correct 168 ms 12504 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 290 ms 22592 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 433 ms 30240 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 588 ms 38264 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 702 ms 44684 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 812 ms 50364 KB Memory limit exceeded
2 Halted 0 ms 0 KB -