제출 #903138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
903138		Muhammad_Aneeq	Friend (IOI14_friend)	C++17	19 / 100	1079 ms	42328 KiB

friend

#include <vector>
#include <iostream>
#include <set>
#include "friend.h"
using namespace std;
int const N=1000;
set<int>nei[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]&&nei[i].find(j)!=nei[i].end())
			return;
	}
	for (int j=0;j<nn;j++)
	{
		if (i==j)
			continue;
		if (nei[i].find(j)==nei[i].end()&&!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];
	set<int>s;
	for (int i=1;i<n;i++)
	{
		s.insert(protocol[i]);
		if (protocol[i]==0)
		{
			nei[i].insert(host[i]);
			nei[host[i]].insert(i);
		}
		else if (protocol[i]==1)
		{
			for (int j=0;j<n;j++)
			{
				if (i==j)
					continue;
				if (nei[host[i]].find(j)!=nei[host[i]].end())
				{
					nei[i].insert(j);
					nei[j].insert(i);
				}
			}
		}
		else
		{
			nei[i].insert(host[i]);
			nei[host[i]].insert(i);
			for (int j=0;j<n;j++)
			{
				if (i==j)
					continue;
				if (nei[host[i]].find(j)!=nei[host[i]].end())
				{
					nei[i].insert(j);
					nei[j].insert(i);
				}
			}
		}
	}
	if (s.size()==1&&*begin(s)==1)
	{
		int ans=0;
		for (int i=0;i<n;i++)
			ans+=val[i];
		return ans;
	}
	for (int i=0;i<n;i++)
	{
		vis[i]=1;
		dfs(i,val[i]);
		vis[i]=0;
	}
	return ans;
}

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