Submission #589595

#	Time	Username	Problem	Language	Result	Execution time	Memory
589595		AlperenT	Friend (IOI14_friend)	C++17	100 / 100	26 ms	3408 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]){
	pair<int, int> ans[n];

	for(int i = 0; i < n; i++) ans[i] = {confidence[i], 0};

	for(int i = n - 1; i >= 1; i--){
		int h = host[i];
		
		if(protocol[i] == 0) ans[h] = {ans[h].first + ans[i].second, max(ans[h].second + ans[i].first, ans[h].second + ans[i].second)};
		else if(protocol[i] == 1) ans[h] = {max({ans[h].first + ans[i].first, ans[h].first + ans[i].second, ans[h].second + ans[i].first}), ans[h].second + ans[i].second};
		else if(protocol[i] == 2) ans[h] = {max(ans[h].first + ans[i].second, ans[h].second + ans[i].first), ans[h].second + ans[i].second};
	}

	return max(ans[0].first, ans[0].second);
}

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