Submission #61065

#	Time	Username	Problem	Language	Result	Execution time	Memory
61065		hamzqq9	Friend (IOI14_friend)	C++14	100 / 100	48 ms	7052 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define sz(x) (x.size())
#define pb push_back
#define N 100005

int findSample(int n,int confidence[],int host[],int protocol[]) {
		
	int P[N],Q[N]={0};

	for(int i=0;i<n;i++) P[i]=confidence[i];

	for(int i=n-1;i>=1;i--) {

		int x=host[i];
		int y=i;

		if(protocol[i]==0) {

			Q[x]=max(Q[x]+Q[y],P[y]+Q[x]);
			P[x]=P[x]+Q[y];

		}

		if(protocol[i]==1) {

			P[x]=max(max(P[x]+Q[y],P[y]+Q[x]),P[x]+P[y]);
			Q[x]=Q[y]+Q[x];

		}

		if(protocol[i]==2) {

			P[x]=max(P[y]+Q[x],P[x]+Q[y]);
			Q[x]=Q[x]+Q[y];

		}

	}

	return max(P[0],Q[0]);

}

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