Submission #902908

#	Time	Username	Problem	Language	Result	Execution time	Memory
902908		Faisal_Saqib	Friend (IOI14_friend)	C++17	0 / 100	1 ms	616 KiB

friend

#include "friend.h"
#include <vector>
using namespace std;
bool adj[11][11];
vector<int> ma[11];
int findSample(int n,int c[],int h[],int p[])
{
	for(int i=1;i<n;i++)
	{
		if(p[i]==0)
		{
			ma[h[i]].push_back(i);
		}
		else if(p[i]==1)
		{
			for(int jk:ma[h[i]])
				ma[jk].push_back(i);
		}
		else
		{
			for(int jk:ma[h[i]])
				ma[jk].push_back(i);
			ma[h[i]].push_back(i);
		}
	}
	for(int i=0;i<n;i++)
		for(int j:ma[i])
			adj[j][i]=adj[i][j]=1;
	int ans=0;
	for(int mask=0;mask<(1ll<<n);mask++)
	{
		int sum=0;
		vector<int> jp;
		for(int j=0;j<n;j++)
		{
			if(mask&(1<<j))
			{
				sum+=c[j];
				jp.push_back(j);
			}
		}
		bool pos=1;
		for(int i:jp)
		{
			for(int j:jp)
			{
				if(adj[i][j])
					pos=0;
			}
		}
		if(pos)
			ans=max(ans,sum);
	}
	return ans;
}

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