Submission #288294

#TimeUsernameProblemLanguageResultExecution timeMemory
288294AKaan37Friend (IOI14_friend)C++17
8 / 100
1 ms384 KiB
#include "friend.h"
 
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	//~ for(int i=1;i<n;i++){
		//~ if(protocol[i]==0){
			//~ v[host[i]].pb(i);
			//~ v[i].pb(host[i]);
			//~ continue;
		//~ }
		//~ if(protocol[i]==1){
			//~ for(int j=0;j<(int)v[node].size();j++){
				
			//~ }
		//~ }
	//~ }
	int ans=0;
	for(int i=0;i<n;i++){
		ans+=confidence[i];
	}
	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...