Submission #1064034

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

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	long long s1 = confidence[0] ,s2 = 0;;
	bool side[n]; side[0] = 0;
	for(int i = 1; i<n; i++){
		side[i] = !side[host[i]];
		if(side[i]) s2+=confidence[i];
		else s1+=confidence[i];
	}
	return max(s1,s2);
}

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