제출 #1015452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015452		amirhoseinfar1385	Friend (IOI14_friend)	C++17	0 / 100	16 ms	2908 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=10+10;
vector<int>adj[maxn];
int all[maxn];

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i=1;i<n;i++){
		all[i]=confidence[i];
		if(protocol[i]==0){
			adj[i].push_back(host[i]);
			adj[host[i]].push_back(i);
		}else if(protocol[i]==1){
			for(auto x:adj[host[i]]){
				adj[i].push_back(x);
				adj[x].push_back(i);
			}
		}else{
			adj[i].push_back(host[i]);
			adj[host[i]].push_back(i);
			for(auto x:adj[host[i]]){
				adj[i].push_back(x);
				adj[x].push_back(i);
			}
		}
	}
	all[0]=confidence[0];
	int res=0;
	for(int i=1;i<(1<<n);i++){
		int f=0;
		for(int j=0;j<n;j++){
			if((i>>j)&1){
				for(auto x:adj[j]){
					if(((i>>x)&1)==1){
						f=1;
					}
				}
			}
		}
		if(f==0){
			int fake=0;
			for(int j=0;j<n;j++){
				if((i>>j)&1){
					fake+=all[j];
				}
			}
			res=max(res,fake);
		}
	}
	return res;
}

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