Submission #743685

#	Time	Username	Problem	Language	Result	Execution time	Memory
743685		bane	Friend (IOI14_friend)	C++17	0 / 100	1 ms	432 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
 
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]){
	vector<int>edges[n];
	for (int i = 1; i < n; i++){
		int b;cin >> b;
		edges[i].push_back(b);
		edges[b].push_back(i);
	}
	vector<vector<int>>dp(n,vector<int>(2,0));
	function<void(int,int)>dfs = [&](int u, int p){
		dp[u][1] = host[u];
		for (int& x : edges[u]){
			if (x == p)continue;
			dfs(x,u);
			dp[u][1] += dp[x][0];
			dp[u][0] += max(dp[x][1], dp[x][0]);
		}
	};
	dfs(0,0);
	return max(dp[0][0], dp[0][1]);
}

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