제출 #70387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
70387		Abelyan	친구 (IOI14_friend)	C++17	100 / 100	45 ms	7084 KiB

friend

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

const int N=100006;
int choose[N],notChoose[N];

int findSample(int n,int value[],int host[],int protocol[]){
	for (int i=0;i<n;i++){
		choose[i]=value[i];
	}
	for (int i=n-1;i>0;i--){
		int v=host[i];
		if (protocol[i]==0){
			choose[v]+=notChoose[i];
			notChoose[v]+=max(notChoose[i],choose[i]);
		}
		else if (protocol[i]==1){
			choose[v]=max(choose[v]+choose[i],max(choose[v]+notChoose[i],choose[i]+notChoose[v]));
			notChoose[v]+=notChoose[i];
		}
		else{
			choose[v]=max(choose[v]+notChoose[i],choose[i]+notChoose[v]);
			notChoose[v]+=notChoose[i];
		}
		//cout<<choose[v]<<" "<<notChoose[v]<<endl;
	}
	return max(choose[0],notChoose[0]);
}
/*
#define __MAXSIZE__ 100002

// Confidence
int confidence[__MAXSIZE__];

// Host
int host[__MAXSIZE__];

// Protocol
int protocol[__MAXSIZE__];

// Main
int main(void)
{
	int n,i;

	// Number of people
	assert(scanf("%d",&n)==1);
	
	// Confidence
	for(i=0;i<n;i++)
		assert(scanf("%d",&confidence[i])==1);
	
	// Host and Protocol
	for(i=1;i<n;i++)
		assert(scanf("%d %d",&host[i],&protocol[i])==2);
	
	// Answer
	printf("%d\n",findSample(n,confidence,host,protocol));
	return 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