Submission #1015432

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015432		parsadox2	Friend (IOI14_friend)	C++17	0 / 100	1 ms	348 KiB

friend

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

using namespace std;

const int N = 1e5 + 10;
int n , ar[N] , col[N];

int findSample(int nn,int confidence[],int host[],int protocol[]){
	n = nn;
	for(int i = 0 ; i < n ; i++)
		ar[i] = confidence[i];
	for(int i = 1 ; i < n ; i++)
	{
		if(protocol[i] == 0)
			col[i] = (col[host[i]] ^ 1);
		else
			col[i] = col[host[i]];
	}
	int cnt = 0;
	for(int i = 0 ; i < n ; i++)
		cnt += col[i];
	return max(cnt , n - cnt);
}

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