Submission #719138

#	Time	Username	Problem	Language	Result	Execution time	Memory
719138		mseebacher	Friend (IOI14_friend)	C++17	19 / 100	6 ms	8404 KiB

friend

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

using namespace std;

#define MAX_N (int) 1e3+10

vector<int> friends[MAX_N];
vector<bool> vis(MAX_N,0);
vector<vector<long long>> dp(MAX_N,vector<long long>(MAX_N,0));

int *dummy;

void dfs(int x,int e){
	if(friends[x].size() == 1){
		dp[x][1] = dummy[x];
	}
	long long mit = 0;
	long long ohne = 0;
	for(auto s: friends[x]){
		if(s == e) continue;
		dfs(s,x);
		mit += dp[s][0];
		ohne += max(dp[s][0],dp[s][1]);
	}
	dp[x][1] = dummy[x]+mit;
	dp[x][0] = ohne;
}

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	dummy = confidence;
	for(int i = 1;i<n;i++){
		friends[i].push_back(host[i]);
		friends[host[i]].push_back(i);
	}	
	dfs(0,-1);
	return max(dp[0][1],dp[0][0]);
}

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