Submission #392352

#	Time	Username	Problem	Language	Result	Execution time	Memory
392352		rainboy	Friend (IOI14_friend)	C11	100 / 100	33 ms	3116 KiB

friend

#include "friend.h"
#include <string.h>

#define N	100000

int max(int a, int b) { return a > b ? a : b; }

int findSample(int n, int *aa, int *pp, int *tt) {
	static int dp[N], dq[N];
	int i;

	memcpy(dp, aa, n * sizeof *aa);
	for (i = n - 1; i >= 0; i--)
		if (i > 0) {
			if (tt[i] == 0)
				dp[pp[i]] += dq[i], dq[pp[i]] += max(dp[i], dq[i]);
			else if (tt[i] == 1)
				dp[pp[i]] = max(dp[pp[i]] + max(dp[i], dq[i]), dq[pp[i]] + dp[i]), dq[pp[i]] += dq[i];
			else
				dp[pp[i]] = max(dp[pp[i]] + dq[i], dq[pp[i]] + dp[i]), dq[pp[i]] += dq[i];
		}
	return max(dp[0], dq[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