oj.uz

Submission #146705

# Submission time Handle Problem Language Result Execution time Memory
146705 2019-08-25T11:55:00 Z MvC Pipes (CEOI15_pipes) C++11
80 / 100
 1524 ms 64980 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+1;
const int mod=1e9+7;
using namespace std;
int n,m,i,x,y,p[nmax],p1[nmax],sz[nmax],sz1[nmax],fup[nmax],fin[nmax],tin,pr[nmax];
vector<pair<int,int> >a[nmax];
int fnd(int x)
{
	if(p[x]==x)return x;
	return p[x]=fnd(p[x]);
}
void uni(int x,int y)
{
	a[x].pb(mkp(y,++tin));
	a[y].pb(mkp(x,tin));
	x=fnd(x),y=fnd(y);
	if(sz[x]<sz[y])swap(x,y);
	sz[x]+=sz[y];
	p[y]=x;
}
int fnd1(int x)
{
	if(p1[x]==x)return x;
	return p1[x]=fnd1(p1[x]);
}
void uni1(int x,int y)
{
	a[x].pb(mkp(y,++tin));
	a[y].pb(mkp(x,tin));
	x=fnd1(x),y=fnd1(y);
	if(sz1[x]<sz1[y])swap(x,y);
	sz1[x]+=sz1[y];
	p1[y]=x;
}
void dfs(int x)
{
	fin[x]=fup[x]=++tin;
	for(int i=0;i<a[x].size();i++)
	{
		if(a[x][i].sc==pr[x])continue;
		if(!fin[a[x][i].fr])
		{
			pr[a[x][i].fr]=a[x][i].sc;
			dfs(a[x][i].fr);
			fup[x]=min(fup[x],fup[a[x][i].fr]);
			if(fup[a[x][i].fr]>fin[x])cout<<x<<" "<<a[x][i].fr<<'\n';
		}
		else fup[x]=min(fup[x],fin[a[x][i].fr]);
	}
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		p[i]=i;
		sz[i]=1;
		p1[i]=i;
		sz1[i]=1;
	}
	while(m--)
	{
		cin>>x>>y;
		if(fnd(x)!=fnd(y))
		{
			uni(x,y);
			//cout<<x<<" "<<y<<endl;
		}
		else if(fnd1(x)!=fnd1(y))
		{
			uni1(x,y);
			//cout<<x<<" "<<y<<endl;
		}
	}
	//cout<<endl;
	for(i=1;i<=n;i++)
	{
		if(fin[i])continue;
		dfs(i);
	}
	return 0;
}

Compilation message

pipes.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
pipes.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
pipes.cpp: In function 'void dfs(int)':
pipes.cpp:55:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<a[x].size();i++)
              ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3320 KB Output is correct
2 Correct 9 ms 3320 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 3208 KB Output is correct
2 Correct 123 ms 3040 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 4088 KB Output is correct
2 Correct 241 ms 3660 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 359 ms 6008 KB Output is correct
2 Correct 305 ms 5592 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 12284 KB Output is correct
2 Correct 437 ms 9464 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 759 ms 13692 KB Output is correct
2 Correct 718 ms 10444 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1010 ms 16168 KB Output is correct
2 Runtime error 956 ms 53524 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1268 ms 16164 KB Output is correct
2 Runtime error 1220 ms 64980 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1524 ms 15524 KB Output is correct
2 Correct 1403 ms 12256 KB Output is correct