Submission #589230

#	Time	Username	Problem	Language	Result	Execution time	Memory
589230		FatihSolak	Friend (IOI14_friend)	C++17	19 / 100	24 ms	3796 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
#define N 1005
using namespace std;
vector<int> adj[N];
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int SUBTASK = 1;
	set<int> s;
	for(int i = 1;i<n;i++){
		s.insert(protocol[i]);
	}
	if(n > 10 && s.size() == 2){
		SUBTASK = 5;
	}
	if(n > 10 && s.size() == 1){
		if(*s.begin() == 0){
			SUBTASK = 4;
		}
		if(*s.begin() == 1){
			SUBTASK = 2;
		}
		if(*s.begin() == 2){
			SUBTASK = 3;
		}
	}
	if(SUBTASK == 1){
		for(int i = 1;i<n;i++){
			if(protocol[i] == 0){
				adj[i].push_back(host[i]);
				adj[host[i]].push_back(i);
			}
			if(protocol[i] == 1){
				for(auto u:adj[host[i]]){
					adj[i].push_back(u);
					adj[u].push_back(i);
				}
			}
			if(protocol[i] == 2){
				for(auto u:adj[host[i]]){
					adj[i].push_back(u);
					adj[u].push_back(i);
				}
				adj[i].push_back(host[i]);
				adj[host[i]].push_back(i);
			}
		}
		long long ans = 0;
		for(int mask = 1;mask < (1<<n);mask++){
			long long sum = 0;
			bool ok = 1;
			for(int i = 0;i<n;i++){
				if(mask & (1<<i)){
					sum += confidence[i];
					for(auto u:adj[i]){
						if(mask & ( 1<<u))
							ok = 0;
					}
				}
			}
			if(ok){
				ans = max(ans,sum);
			}
		}
		return ans;
	}
	if(SUBTASK == 2){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			sum += confidence[i];
		}
		return sum;
	}
	return 0;
}

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