Submission #810292

#	Time	Username	Problem	Language	Result	Execution time	Memory
810292		Kerim	Friend (IOI14_friend)	C++17	100 / 100	22 ms	3140 KiB

friend

#include "friend.h"
#include "bits/stdc++.h"
#define pb(x) push_back(x)
using namespace std;

const int MAXN = 1e5+5;
int p[MAXN], q[MAXN];

int findSample(int n,int arr[],int host[],int protocol[]){
	for (int i = 0; i < n; i++)
		p[i] = arr[i], q[i] = 0;
	for (int i = n-1; i > 0; i--){
		int pp = protocol[i];
		int v = host[i];
		if (pp == 2){ //WeAreYourFriends
			p[v] = max(p[v] + q[i], p[i] + q[v]);
			q[v] = q[v] + q[i];
		}
		else if (pp == 1){//MyFriendsAreYourFriends
			p[v] = max(p[v]+p[i], max(p[v] + q[i], p[i] + q[v]));
			q[v] = q[v] + q[i];
		}
		else{//IamYourFriend
			p[v] = p[v] + q[i];
			q[v] = max(p[i] + q[v], q[v] + q[i]);
		}
	}
	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