Submission #1290136

#	Time	Username	Problem	Language	Result	Execution time	Memory
1290136		Jawad_Akbar_JJ	Friend (IOI14_friend)	C++20	100 / 100	16 ms	2200 KiB

friend

#include <iostream>

using namespace std;
const int M = 1<<17;
int p[M], q[M];

int findSample(int n, int cnf[], int hst[], int prt[]){
	for (int i=1;i<=n;i++)
		p[i] = cnf[i - 1];

	for (int i=n-1;i;i--){
		int a = hst[i] + 1, b = i + 1;

		if (prt[i] == 0){
			p[a] = p[a] + q[b];
			q[a] = q[a] + max(p[b], q[b]);
		}
		else if (prt[i] == 1){
			p[a] = max(p[a] + p[b], max(p[a] + q[b], p[b] + q[a]));
			q[a] = q[a] + q[b];
		}
		else{
			p[a] = max(p[a] + q[b], p[b] + q[a]);
			q[a] = q[b] + q[a];
		}
		// cout<<a<<" "<<b<<"            "<<p[a]<<" "<<q[a]<<endl;
	}
	return max(p[1], q[1]);
}

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