Submission #1016336

#	Time	Username	Problem	Language	Result	Execution time	Memory
1016336		parsadox2	Friend (IOI14_friend)	C++17	100 / 100	23 ms	7004 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
using namespace std;

const int N = 1e5 + 10;

int ty[N] , n , ar[N] , dp[N][2];
vector <int> adj[N];

void Dfs(int v)
{
	for(auto u : adj[v])
		Dfs(u);
	dp[v][0] = 0;
	dp[v][1] = ar[v];
	for(int i = adj[v].size() - 1 ; i >= 0 ; i--)
	{
		auto u = adj[v][i];
		if(ty[u] == 1)
		{
			dp[v][0] += dp[u][1];
			dp[v][1] = max(dp[v][0] , dp[v][1] + dp[u][0]);
		}
		else if(ty[u] == 2)
		{
			dp[v][0] += dp[u][0];
			dp[v][1] += dp[u][1];
		}
		else
		{
			dp[v][1] = max(dp[v][0] + dp[u][1] , dp[v][1] + dp[u][0]);
			dp[v][0] += dp[u][0];
		}
	}
}

int findSample(int nn , int confidence[] , int host[] , int protocol[]){
	n = nn;
	for(int i = 0 ; i < n ; i++)
		ar[i] = confidence[i];
	for(int i = 1 ; i < n ; i++)
	{
		adj[host[i]].push_back(i);
		ty[i] = protocol[i] + 1;
	}
	Dfs(0);
	return dp[0][1];
}

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