제출 #422251

#제출 시각아이디문제언어결과실행 시간메모리
422251dreezy친구 (IOI14_friend)C++17
8 / 100
1 ms296 KiB
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;


/*******************/
// Find out best sample
#define pi pair<int,int>
#define ll long long
#define f first
#define s second
#define pb push_back

int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans  = 0;
	for(int i =0; i<n; i++){
		ans = max(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...