Submission #285777

#	Time	Username	Problem	Language	Result	Execution time	Memory
285777		Saboon	Friend (IOI14_friend)	C++14	46 / 100	40 ms	2936 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1050;
const int inf = 1e9;

int adj[14], pd[maxn], dp[maxn], c[maxn];
vector<int> t[maxn];

int dfs(int v){
	dp[v] = c[v];
	pd[v] = 0;
	for (auto u : t[v]){
		dfs(u);
		pd[v] += dp[u];
		dp[v] += pd[u];
	}
	dp[v] = max(dp[v],pd[v]);
	return dp[v];
}

int findSample(int n,int confidence[],int host[],int protocol[]){
	for (int i = 0; i < n; i++)
		c[i] = confidence[i];
	if (*min_element(protocol+1, protocol+n) == 1 and *max_element(protocol+1, protocol+n) == 1){
		int sum = 0;
		for (int i = 0; i < n; i++)
			sum += confidence[i];
		return sum;
	}
	if (*min_element(protocol+1, protocol+n) == 2 and *max_element(protocol+1, protocol+n) == 2)
		return *max_element(confidence, confidence+n);
	if (n <= 10){
		for (int i = 0; i < n; i++)
			adj[i] = (1 << i);
		for (int i = 1; i < n; i++){
			if (protocol[i] == 0)
				adj[host[i]] |= (1 << i), adj[i] |= (1 << host[i]);
			else
				for (int j = 0; j < n; j++)
					if (adj[host[i]] & (1 << j) and j != host[i])
						adj[j] |= (1 << i), adj[i] |= (1 << j);
			if (protocol[i] == 2)
				adj[host[i]] |= (1 << i), adj[i] |= (1 << host[i]);
		}
		dp[0] = 0;
		for (int mask = 1; mask < (1 << n); mask++){
			dp[mask] = -inf;
			for (int i = 0; i < n; i++){
				if (mask & (1 << i)){
					int sub = (mask & (adj[i]|(1<<i)));
					dp[mask] = dp[mask^sub] + confidence[i];
				}
			}
		}
		return *max_element(dp, dp+(1<<n));
	}
	if (*min_element(protocol+1, protocol+n) == 0 and *max_element(protocol+1, protocol+n) == 0){
		for (int i = 1; i < n; i++)
			t[host[i]].push_back(i);
		return dfs(0);
	}
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^

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