Submission #413738

#	Time	Username	Problem	Language	Result	Execution time	Memory
413738		Antekb	친구 (IOI14_friend)	C++14	11 / 100	1081 ms	65540 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// Find out best sample
const int N=1e5+5;
int dp[N][2], w[N];
vector<int> E[N];
void dfs(int v){
	for(int u:E[v]){
		dfs(u);
		dp[v][0]+=dp[u][1];
		dp[v][1]+=dp[u][0];
	}
	dp[v][1]+=w[v];
	if(dp[v][1]<dp[v][0])dp[v][1]=dp[v][0];
}
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i=0; i<n; i++){
		w[i]=confidence[i];
	}
	for(int i=1; i<n; i++){
		if(protocol[i]==0){
			E[host[i]].push_back(i);
			E[i].push_back(host[i]);
		}
		else{
			for(int j:E[host[i]]){
				E[i].push_back(j);
				E[j].push_back(i);
			}
			if(protocol[i]==2){
				E[host[i]].push_back(i);
				E[i].push_back(host[i]);
			}
		}
	}
	int ans=0;
	for(int i=0; i<(1<<n); i++){
		int k=0;
		bool b=1;
		for(int j=0; j<n; j++){
			if(i&(1<<j)){
				k+=w[j];
				for(int l:E[j])if(i&(1<<l))b=0;
			}
		}
		if(b)ans=max(ans, k);
	}
	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