Submission #1277287

#TimeUsernameProblemLanguageResultExecution timeMemory
1277287JohannFriend (IOI14_friend)C++20
8 / 100
1 ms576 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...