Submission #285537

#TimeUsernameProblemLanguageResultExecution timeMemory
285537erd1Friend (IOI14_friend)C++14
16 / 100
1 ms512 KiB
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef int64_t lld;
typedef pair<int, int> pii;
typedef long double ld;


// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans=0;
	if(protocol[1] == 1){
		for(int i = 0; i < n; i++)ans += confidence[i];
		return ans;
	}else return *max_element(confidence, confidence + n);
	return ans;
}
#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...