제출 #1232958

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232958		kl0989e	친구 (IOI14_friend)	C++20	100 / 100	16 ms	2120 KiB

friend

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

#define ll long long
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()

int findSample(int n, int val[], int host[], int prot[]) {
	vi sel(n),nsel(n,0);
	for (int i=0; i<n; i++) {
		sel[i]=val[i];
	}
	for (int i=n-1; i>0; i--) {
		if (prot[i]==0) {
			int newsel=sel[host[i]]+nsel[i];
			nsel[host[i]]=nsel[host[i]]+max(sel[i],nsel[i]);
			sel[host[i]]=newsel;
		}
		else if (prot[i]==1) {
			int newsel=max(sel[i]+sel[host[i]],max(nsel[i]+sel[host[i]],sel[i]+nsel[host[i]]));
			nsel[host[i]]=nsel[host[i]]+nsel[i];
			sel[host[i]]=newsel;
		}
		else {
			int newsel=max(nsel[i]+sel[host[i]],sel[i]+nsel[host[i]]);
			nsel[host[i]]=nsel[host[i]]+nsel[i];
			sel[host[i]]=newsel;
		}
	}
	return max(sel[0],nsel[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