Submission #749924

#	Time	Username	Problem	Language	Result	Execution time	Memory
749924		Abrar_Al_Samit	Friend (IOI14_friend)	C++17	11 / 100	1057 ms	3908 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;


int g[10][10];

int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i=1; i<n; ++i) {
		if(protocol[i]==0) {
			g[host[i]][i] = g[i][host[i]] = 1;
		} else if(protocol[i]==1) {
			for(int j=0; j<n; ++j) if(g[host[i]][j]) {
				g[i][j] = g[j][i] = 1;
			}
		} else {
			g[host[i]][i] = g[i][host[i]] = 1;
			for(int j=0; j<n; ++j) if(g[host[i]][j]) {
				g[i][j] = g[j][i] = 1;
			}
		}
	}

	int ans = 0;
	for(int mask=1; mask<(1<<n); ++mask) {
		bool valid = true;
		for(int i=0; i<n; ++i) {
			for(int j=i+1; j<n; ++j) {
				if((mask>>i&1) && (mask>>j&1) && g[i][j]) {
					valid = false;
				}
			}
		}
		if(!valid) continue;

		int cur = 0;
		for(int j=0; j<n; ++j) if(mask>>j&1) {
			cur += confidence[j];
		}
		ans = max(ans, cur);
	}
	return ans;
}

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