Submission #49247

#	Time	Username	Problem	Language	Result	Execution time	Memory
49247		Diuven	Friend (IOI14_friend)	C++11	27 / 100	77 ms	4708 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int MX=100010;

int findSample(int n, int A[], int F[], int Prot[]){
	int X[MX], Y[MX]; // picked / not-picked
	for(int i=0; i<n; i++) X[i]=A[i], Y[i]=0;
	for(int i=n-1; i>0; i--){
		if(Prot[i]==0){
			X[F[i]]=X[F[i]]+Y[i];
			Y[F[i]]=Y[F[i]]+X[i];
		}
		else if(Prot[i]==1){
			X[F[i]]=max({X[F[i]]+Y[i], X[F[i]]+X[i], Y[F[i]]+X[i]});
			Y[F[i]]=Y[F[i]]+Y[i];
		}
		else{
			X[F[i]]=max(X[F[i]]+Y[i], Y[F[i]]+X[i]);
			Y[F[i]]=Y[F[i]]+Y[i];
		}
	}
	return max(X[0],Y[0]);
}

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