제출 #293858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293858		VodkaInTheJar	친구 (IOI14_friend)	C++14	100 / 100	36 ms	3228 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
 
using namespace std;

const int maxn = 1e5 + 3; 

pair <int, int> ans[maxn]; 
int findSample(int n, int confidence[], int host[], int protocol[])
{
	for (int i = 0; i < n; i++)
	ans[i] = {confidence[i], 0};
	
	for (int i = n-1; i >= 1; i--)
	{
		int par = host[i];
		
		if (protocol[i] == 0)
		{
			ans[par].first += ans[i].second;
			ans[par].second += max(ans[i].first, ans[i].second);
		}
		
		else 
		if (protocol[i] == 2)
		{
			ans[par].first = max(ans[par].first + ans[i].second, ans[par].second + ans[i].first);
			ans[par].second = ans[par].second + ans[i].second;
		}
		
		else 
		{
			ans[par].first = max({ans[par].first + ans[i].first, ans[par].first + ans[i].second, ans[par].second + ans[i].first});
			ans[par].second = ans[par].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