Submission #1288809

#	Time	Username	Problem	Language	Result	Execution time	Memory
1288809		Faisal_Saqib	Friend (IOI14_friend)	C++17	19 / 100	2 ms	2884 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+100;
int dp[N][2],a[N];
vector<int> ma[N];
void dfs(int x) // dp[x][0] = not taking, dp[x][1] = taking
{
	dp[x][0]=0;
	dp[x][1]=a[x];
	for(auto y:ma[x])
	{
		dfs(y);
		dp[x][0]+=max(dp[y][0],dp[y][1]);
		dp[x][1]+=dp[y][0];
	}
}
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i=0;i<n;i++)a[i]=confidence[i];
	for(int i=1;i<n;i++)
	{
		ma[host[i]].push_back(i);
	}
	dfs(0);
	return max(dp[0][0],dp[0][1]);
}

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