제출 #1078734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078734		Muhammad_Aneeq	Connecting Supertrees (IOI20_supertrees)	C++17	40 / 100	153 ms	24148 KiB

supertrees

#include <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
bool ed[MAXN][MAXN]={};
bool vis[MAXN]={};
bool in[MAXN]={};
vector<int>ans,cur;
bool check(int u)
{
	for (auto i:cur)
	{
		if (ed[i][u]==0)
			return 0;
	}
	return 1;
}
void dfs(int u,int p=-1)
{
	cur.push_back(u);
	vis[u]=1;
	in[u]=1;
	for (int i=0;i<MAXN;i++)
	{
		if (u==i)
			continue;
		if (!vis[i]&&ed[u][i]&&check(i))
			dfs(i,u);
		if (i!=p&&ed[i][u]&&in[i])
			ans=cur;
	}
	in[u]=0;
	cur.pop_back();
}
void build(vector<vector<int>> b);
int construct(vector<vector<int>> p)
{
	int n=p.size();
	bool subt1=1,subt2=1,subt3=1,subt4=1;
	for (int i=0;i<n;i++)
	{
		for (int j=i+1;j<n;j++)
		{
			if (p[i][j]!=1)
				subt1=0;
			if (p[i][j]>1)
				subt2=0;
			if (p[i][j]==1)
				subt3=0;
			if (p[i][j]>2)
				subt4=0;
		}
	}
	if (subt1)
	{
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=1;i<n;i++)
			b[0][i]=b[i][0]=1;
		build(b);
		return 1;
	}
	if (subt2)
	{
		bool vis[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!vis[i])
			{
				vis[i]=1;
				head[i]=i;
				for (int j=0;j<n;j++)
				{
					if (vis[j])
						continue;
					if (p[i][j])
					{
						vis[j]=1;
						b[i][j]=b[j][i]=1;
						head[j]=i;
					}
				}
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=0;j<n;j++)
			{
				if (p[i][j]&&head[i]!=head[j])
					return 0;
				if (p[i][j]==0&&head[i]==head[j])
					return 0;
			}
		}
		build(b);
		return 1;
	}
	if (subt3)
	{
		bool vis[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!vis[i])
			{
				vector<int>z;
				for (int j=0;j<n;j++)
				{
					if (p[i][j])
						z.push_back(j);
				}
				if (z.size()==1)
				{
					head[i]=i;
					continue;
				}
				if (z.size()==2)
					return 0;
				for (int j=0;j<z.size();j++)
				{
					vis[z[j]]=1;
					head[z[j]]=i;
					b[z[j]][z[(j+1)%z.size()]]=b[z[(j+1)%z.size()]][z[j]]=1;
				}
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=i+1;j<n;j++)
			{
				if (p[i][j]&&head[i]!=head[j])
					return 0;
				if (p[i][j]==0&&head[i]==head[j])
					return 0;
			}
		}
		build(b);
		return 1;
	}
	if (subt4)
	{
		for (int i=0;i<n;i++)
			for (int j=i+1;j<n;j++)
				if (p[i][j]==2)
					ed[i][j]=ed[j][i]=1;
		bool seen[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!seen[i])
			{
				seen[i]=1;
				head[i]=i;
				for (int j=0;j<n;j++)
				{
					if (seen[j])
						continue;
					if (p[i][j])
					{
						seen[j]=1;
						b[i][j]=b[j][i]=1;
						head[j]=i;
					}
				}
			}
		}
		bool done[n]={};
		for (int i=0;i<n;i++)
		{
			if (!done[i])
			{
				ans={},cur={};
				dfs(i);
				for (auto j:ans)
					done[j]=1;
				if (ans.size()>1)
				{
					for (int j=0;j<ans.size();j++)
					{
						head[ans[j]]=i;
						b[ans[j]][ans[(j+1)%ans.size()]]=b[ans[(j+1)%ans.size()]][ans[j]]=1;
					}
				}
			}
		}
		build(b);
		return 1;
	}
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:121:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |     for (int j=0;j<z.size();j++)
      |                  ~^~~~~~~~~
supertrees.cpp:181:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  181 |      for (int j=0;j<ans.size();j++)
      |                   ~^~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4