제출 #119794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119794		tinjyu	Simurgh (IOI17_simurgh)	C++14	13 / 100	1682 ms	4216 KiB

simurgh

#include "simurgh.h"
#include <iostream>
using namespace std;
long long int Na,can,tag[5005],map[505][505],r,road[5005],tmpans[505][505],s1,s2,anstag[2500000],p;
long long int bfs(int x)
{
	for(int i=0;i<Na;i++)
	{
		if(map[i][x]!=-1 && tag[i]==0 && map[i][x]!=s1 && map[i][x]!=s2)
		{
			//cout<<x<<" "<<i<<"  ";
			tag[i]=1;
			road[p]=map[i][x];
			p++;
			bfs(i);
		}
	}
	return 0;
}
std::vector<int> find_roads(int N, std::vector<int> u, std::vector<int> v) {
	Na=N;
	long long int M=u.size();
	for(int i=0;i<Na;i++)
	{
		for(int j=0;j<Na;j++)map[i][j]=-1;
	}
	for(int i=0;i<M;i++)
	{
		map[u[i]][v[i]]=i;
		map[v[i]][u[i]]=i;
	}	
	for(int i=0;i<Na;i++)
	{
		int c=-1;
		for(int j=0;j<Na;j++)
		{
			if(map[i][j]!=-1)
			{
				//cout<<j<<endl;
				if(c==-1)
				{
					c=j;
					tmpans[i][0]=1;
					tmpans[i][1]=map[i][j];
				}
				else
				{
					for(int k=0;k<Na;k++)tag[k]=0;
					tag[c]=1;
					tag[i]=1;
					s1=map[i][c];
					s2=map[i][j];
					p=0;
					bfs(c);
					//cout<<endl;
					
					//cout<<endl;
					//for(int k=0;k<Na;k++)tmp+=tag[k];
					//cout<<tmp<<endl;
					if(tag[j]==1)
					{
						bfs(i);
						std::vector<int> r(Na - 1);
						for(int k=0;k<Na-1;k++)r[k]=road[k];
						for(int k=0;k<Na;k++)tag[k]=0;
						
						
						r[Na-2]=map[i][c];
						/*for(int k=0;k<Na;k++)
						{
							long long int t=r[k];
							//cout<<t<<" "<<u[t]<<" "<<v[t]<<"  ";
							tag[u[t]]++;
							tag[v[t]]++;
						}
						for(int k=0;k<Na;k++)
						{
							cout<<tag[k]<<" ";
							tag[k]=0;
						}
						cout<<endl;*/
						long long int a= count_common_roads(r);
						r[Na-2]=map[i][j];
						/*for(int k=0;k<Na;k++)
						{
							long long int t=r[k];
							//cout<<t<<" "<<u[t]<<" "<<v[t]<<"  ";
							tag[u[t]]++;
							tag[v[t]]++;
						}
						for(int k=0;k<Na;k++)
						{
							cout<<tag[k]<<" ";
							tag[k]=0;
						}
						cout<<endl;*/
						long long int b= count_common_roads(r);
						if(a==b)
						{
							tmpans[i][0]++;
							tmpans[i][tmpans[i][0]]=map[i][j];
						}
						else if(a<b)
						{
							tmpans[i][0]=1;
							tmpans[i][1]=map[i][j];
							c=j;
						}
					}
					else
					{
						tmpans[i][0]++;
						tmpans[i][tmpans[i][0]]=map[i][j];
					}
				}
			}
			//cout<<endl;
			//for(int k=1;k<=tmpans[i][0];k++)cout<<tmpans[i][k]<<" ";
			//cout<<endl;
		}
		//cout<<endl;
	}
	std::vector<int> r(Na - 1);
	//cout<<"can"<<endl;
 
	long long int p=0;
	for(int i=0;i<Na;i++)
	{
		//cout<<i<<endl;
		//cout<<tmpans[i][0]<<endl;
		for(int j=1;j<=tmpans[i][0];j++)
		{
			if(anstag[tmpans[i][j]]==0)
			{
				anstag[tmpans[i][j]]=1;
				r[p]=tmpans[i][j];	
				//cout<<r[p]<<" ";
				p++;
			}
		}
		//cout<<endl;
	}
	return r;
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30