Submission #1277287

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277287		Johann	Friend (IOI14_friend)	C++20	8 / 100	1 ms	576 KiB

friend

#include "friend.h"

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

#define sz(x) (int)(x.size())

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vi;
typedef vector<pii> vpii;

// Find out best sample
int findSample(int n, int confidence[], int host[], int protocol[])
{
	int ans = 0;
	// subtaks 2: only my friends are your friends -> independent set!
	int sum = accumulate(confidence, confidence + n, 0);
	// subtask 3: only we are your friends -> complete graph
	int maxi = *max_element(confidence, confidence + n);
	return sum;
}

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