제출 #903167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
903167		Muhammad_Aneeq	Friend (IOI14_friend)	C++17	27 / 100	1072 ms	10888 KiB

friend

#include <vector>
#include <iostream>
#include <set>
using namespace std;
int const N=2000;
bool ed[N][N]={};
int vis[N]={};
int ans=0;
int nn;
int val[N]={};
void dfs(int i,int val1)
{
	for (int j=0;j<nn;j++)
	{
		if (i==j)
			continue;
		if (vis[j]&&ed[i][j]==0)
			return;
	}
	for (int j=0;j<nn;j++)
	{
		if (i==j)
			continue;
		if (ed[i][j]&&!vis[j])
		{
			vis[j]=1;
			dfs(j,val1+val[j]);
			vis[j]=0;
		}
	}
	ans=max(ans,val1);
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
	nn=n;
	for (int i=0;i<n;i++)
		val[i]=confidence[i];
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			ed[i][j]=1;
		set<int>s;
	for (int i=1;i<n;i++)
	{
		s.insert(protocol[i]);
		if (protocol[i]==0)
			ed[i][host[i]]=ed[host[i]][i]=0;
		else if (protocol[i]==1)
		{
			for (int j=0;j<n;j++)
			{
				if (ed[host[i]][j]==0)
					ed[i][j]=ed[j][i]=0;
			}
		}
		else
		{
			ed[i][host[i]]=ed[host[i]][i]=0;
			for (int j=0;j<n;j++)
			{
				if (ed[host[i]][j]==0)
					ed[i][j]=ed[j][i]=0;
			}
		}
	}
	if (s.size()==1&&*begin(s)==1)
	{
		int ans=0;
		for (int i=0;i<n;i++)
			ans+=val[i];
		return ans;
	}
	vis[0]=1;
	dfs(0,val[0]);
	vis[0]=0;
	for (int j=0;j<n;j++)
	{
		if (ed[0][j]==0)
		{
			vis[j]=1;
			dfs(j,val[j]);
			vis[j]=0;
		}
	}
	return ans;
}

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

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:38:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   38 |  for (int i=0;i<n;i++)
      |  ^~~
friend.cpp:41:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   41 |   set<int>s;
      |   ^~~

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31