Submission #465639

#	Time	Username	Problem	Language	Result	Execution time	Memory
465639		blue	Friend (IOI14_friend)	C++17	100 / 100	29 ms	3452 KiB

friend

#include "friend.h"
#include <vector>
using namespace std;
int findSample(int n,int confidence[],int host[],int protocol[]){
	vector<int> Yes(n, 0), No(n, 0);
	for(int i = 0; i < n; i++) Yes[i] += confidence[i];
	for(int i = n-1; i >= 1; i--){
		if(protocol[i] == 0) {
			Yes[ host[i] ] += No[i];
			No[ host[i] ] += max(Yes[i], No[i]);
		}
		else if(protocol[i] == 1){
			Yes[ host[i] ] = max(Yes[ host[i] ] + max(Yes[i], No[i]), No[ host[i] ] + Yes[i]);
            No[ host[i] ] += No[i];
		}
		else{
			Yes[ host[i] ] = max(Yes[ host[i] ] + No[i], No[ host[i] ] + Yes[i]);
			No[ host[i] ] += No[i];
		}
	}
	return max(Yes[0], No[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