답안 #62467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62467 2018-07-28T17:59:20 Z zetapi 낙하산 고리들 (IOI12_rings) C++14
100 / 100
2122 ms 86752 KB
#include <bits/stdc++.h>
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e6;

vector<int> vec[MAX];

int linear[4],destruct[4],deg[4][MAX],OtherEnd[4][MAX];

int N,cnt,CycleSize,Quad;

void Init(int N_) 
{
  	N=N_;
  	cnt=0;
  	Quad=0;
  	CycleSize=0;
  	for(int A=0;A<N;A++)
  	{
  		deg[0][A]=0;
  		OtherEnd[0][A]=A;
  		vec[A].clear();
  	}
  	return ;
}

void Add(int X,int Y)
{
	int a,b;
	for(int A=0;A<4;A++) 	
	{
		if(!linear[A])
			continue;
		if(destruct[A]==X or destruct[A]==Y)
			continue;
		deg[A][X]++;
		deg[A][Y]++;
		if(deg[A][X]==3 or deg[A][Y]==3 or OtherEnd[A][X]==Y)
		{
			linear[A]=0;
			continue;
		}
		a=OtherEnd[A][X];
		b=OtherEnd[A][Y];
		OtherEnd[A][X]=-1;
		OtherEnd[A][Y]=-1;
		OtherEnd[A][a]=b;
		OtherEnd[A][b]=a;
	}
	return ;
}

void Split(int X)
{
	destruct[0]=X;
	destruct[1]=vec[X][0];
	destruct[2]=vec[X][1];
	destruct[3]=vec[X][2];
	for(int A=0;A<4;A++)
	{
		linear[A]=1;
		for(int B=0;B<N;B++)
		{
			deg[A][B]=0;
			OtherEnd[A][B]=B;
		}
	}
	for(int A=0;A<N;A++)
		for(auto B:vec[A])
			if(A<B)
				Add(A,B);
	return ;	
}

void Link(int A,int B) 
{
	int X=A,Y=B,a,b;
	vec[X].pb(Y);
	vec[Y].pb(X);
	if(Quad==0)
	{
		deg[0][X]++;
		deg[0][Y]++;
		if(deg[0][X]==3)
		{
			Quad=1;
			Split(X);
			return ;
		}
		if(deg[0][Y]==3)
		{
			Quad=1;
			Split(Y);
			return ;
		}
		if(OtherEnd[0][X]!=Y)
		{
			a=OtherEnd[0][X];
			b=OtherEnd[0][Y];
			OtherEnd[0][X]=-1;
			OtherEnd[0][Y]=-1;
			OtherEnd[0][a]=b;
			OtherEnd[0][b]=a;
		}
		else
		{
			cnt++;
			int cur=X,pre=X;
			do
			{
				CycleSize++;
				if(vec[cur][0]==pre)
				{
					pre=cur;
					cur=vec[cur][1];
				}
				else
				{
					pre=cur;
					cur=vec[cur][0];
				}
			}
			while(cur!=X);
		}
	}
	else
		Add(X,Y);
	return ;
}

int CountCritical() 
{	
	if(!Quad)
	{
		if(cnt>1)
			return 0;
		else if(CycleSize)
			return CycleSize;
		else
			return N;
	}
	else
		return (linear[0]+linear[1]+linear[2]+linear[3]);
}

/*signed main()
{
	ios_base::sync_with_stdio(false);

	Init(7);
	cout<<CountCritical()<<"\n";
	Link(1,2);
	cout<<CountCritical()<<"\n";
	Link(0,5);
	cout<<CountCritical()<<"\n";
	Link(2,0);
	cout<<CountCritical()<<"\n";
	Link(3,2);
	cout<<CountCritical()<<"\n";
	Link(3,5);
	cout<<CountCritical()<<"\n";
	Link(4,3);
	cout<<CountCritical()<<"\n";
	return 0;
}*/
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 23 ms 24344 KB Output is correct
3 Correct 24 ms 24344 KB Output is correct
4 Correct 22 ms 24344 KB Output is correct
5 Correct 23 ms 24344 KB Output is correct
6 Correct 25 ms 24344 KB Output is correct
7 Correct 22 ms 24344 KB Output is correct
8 Correct 26 ms 24344 KB Output is correct
9 Correct 26 ms 24360 KB Output is correct
10 Correct 25 ms 24360 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 478 ms 44328 KB Output is correct
2 Correct 1217 ms 74368 KB Output is correct
3 Correct 938 ms 82728 KB Output is correct
4 Correct 1297 ms 82728 KB Output is correct
5 Correct 1278 ms 82728 KB Output is correct
6 Correct 1321 ms 82728 KB Output is correct
7 Correct 916 ms 82728 KB Output is correct
8 Correct 1884 ms 82768 KB Output is correct
9 Correct 2122 ms 86752 KB Output is correct
10 Correct 1144 ms 86752 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 23 ms 24344 KB Output is correct
3 Correct 24 ms 24344 KB Output is correct
4 Correct 22 ms 24344 KB Output is correct
5 Correct 23 ms 24344 KB Output is correct
6 Correct 25 ms 24344 KB Output is correct
7 Correct 22 ms 24344 KB Output is correct
8 Correct 26 ms 24344 KB Output is correct
9 Correct 26 ms 24360 KB Output is correct
10 Correct 25 ms 24360 KB Output is correct
11 Correct 24 ms 86752 KB Output is correct
12 Correct 27 ms 86752 KB Output is correct
13 Correct 32 ms 86752 KB Output is correct
14 Correct 28 ms 86752 KB Output is correct
15 Correct 26 ms 86752 KB Output is correct
16 Correct 26 ms 86752 KB Output is correct
17 Correct 28 ms 86752 KB Output is correct
18 Correct 29 ms 86752 KB Output is correct
19 Correct 27 ms 86752 KB Output is correct
20 Correct 27 ms 86752 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 23 ms 24344 KB Output is correct
3 Correct 24 ms 24344 KB Output is correct
4 Correct 22 ms 24344 KB Output is correct
5 Correct 23 ms 24344 KB Output is correct
6 Correct 25 ms 24344 KB Output is correct
7 Correct 22 ms 24344 KB Output is correct
8 Correct 26 ms 24344 KB Output is correct
9 Correct 26 ms 24360 KB Output is correct
10 Correct 25 ms 24360 KB Output is correct
11 Correct 24 ms 86752 KB Output is correct
12 Correct 27 ms 86752 KB Output is correct
13 Correct 32 ms 86752 KB Output is correct
14 Correct 28 ms 86752 KB Output is correct
15 Correct 26 ms 86752 KB Output is correct
16 Correct 26 ms 86752 KB Output is correct
17 Correct 28 ms 86752 KB Output is correct
18 Correct 29 ms 86752 KB Output is correct
19 Correct 27 ms 86752 KB Output is correct
20 Correct 27 ms 86752 KB Output is correct
21 Correct 43 ms 86752 KB Output is correct
22 Correct 60 ms 86752 KB Output is correct
23 Correct 66 ms 86752 KB Output is correct
24 Correct 66 ms 86752 KB Output is correct
25 Correct 39 ms 86752 KB Output is correct
26 Correct 77 ms 86752 KB Output is correct
27 Correct 113 ms 86752 KB Output is correct
28 Correct 77 ms 86752 KB Output is correct
29 Correct 63 ms 86752 KB Output is correct
30 Correct 83 ms 86752 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 23 ms 24344 KB Output is correct
3 Correct 24 ms 24344 KB Output is correct
4 Correct 22 ms 24344 KB Output is correct
5 Correct 23 ms 24344 KB Output is correct
6 Correct 25 ms 24344 KB Output is correct
7 Correct 22 ms 24344 KB Output is correct
8 Correct 26 ms 24344 KB Output is correct
9 Correct 26 ms 24360 KB Output is correct
10 Correct 25 ms 24360 KB Output is correct
11 Correct 478 ms 44328 KB Output is correct
12 Correct 1217 ms 74368 KB Output is correct
13 Correct 938 ms 82728 KB Output is correct
14 Correct 1297 ms 82728 KB Output is correct
15 Correct 1278 ms 82728 KB Output is correct
16 Correct 1321 ms 82728 KB Output is correct
17 Correct 916 ms 82728 KB Output is correct
18 Correct 1884 ms 82768 KB Output is correct
19 Correct 2122 ms 86752 KB Output is correct
20 Correct 1144 ms 86752 KB Output is correct
21 Correct 24 ms 86752 KB Output is correct
22 Correct 27 ms 86752 KB Output is correct
23 Correct 32 ms 86752 KB Output is correct
24 Correct 28 ms 86752 KB Output is correct
25 Correct 26 ms 86752 KB Output is correct
26 Correct 26 ms 86752 KB Output is correct
27 Correct 28 ms 86752 KB Output is correct
28 Correct 29 ms 86752 KB Output is correct
29 Correct 27 ms 86752 KB Output is correct
30 Correct 27 ms 86752 KB Output is correct
31 Correct 43 ms 86752 KB Output is correct
32 Correct 60 ms 86752 KB Output is correct
33 Correct 66 ms 86752 KB Output is correct
34 Correct 66 ms 86752 KB Output is correct
35 Correct 39 ms 86752 KB Output is correct
36 Correct 77 ms 86752 KB Output is correct
37 Correct 113 ms 86752 KB Output is correct
38 Correct 77 ms 86752 KB Output is correct
39 Correct 63 ms 86752 KB Output is correct
40 Correct 83 ms 86752 KB Output is correct
41 Correct 248 ms 86752 KB Output is correct
42 Correct 844 ms 86752 KB Output is correct
43 Correct 310 ms 86752 KB Output is correct
44 Correct 706 ms 86752 KB Output is correct
45 Correct 871 ms 86752 KB Output is correct
46 Correct 951 ms 86752 KB Output is correct
47 Correct 1127 ms 86752 KB Output is correct
48 Correct 499 ms 86752 KB Output is correct
49 Correct 770 ms 86752 KB Output is correct
50 Correct 832 ms 86752 KB Output is correct
51 Correct 332 ms 86752 KB Output is correct
52 Correct 610 ms 86752 KB Output is correct
53 Correct 512 ms 86752 KB Output is correct
54 Correct 1596 ms 86752 KB Output is correct
55 Correct 1166 ms 86752 KB Output is correct