Submission #780129

#	Time	Username	Problem	Language	Result	Execution time	Memory
780129		Sohsoh84	Friend (IOI14_friend)	C++17	8 / 100	1 ms	340 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6 + 10;

int col[MAXN];

int findSample(int n, int C[], int host[], int protocol[]){
	int ans[2] = {0, 0};
	ans[0] += C[0];
	for (int i = 1; i <= n - 1; i++) {
		col[i] = col[host[i]];
		if (protocol[i] == 0)
			col[i] ^= 1;

		ans[col[i]] += C[i];
	}

	return max(ans[0], ans[1]);
}

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