제출 #136135

#제출 시각아이디문제언어결과실행 시간메모리
136135arthurconmyFriend (IOI14_friend)C++14
8 / 100
2 ms412 KiB
#include <bits/stdc++.h>
#ifndef ARTHUR_LOCAL
	#include "friend.h"
#endif
using namespace std;

int link[1000];
int sz[1000];
int ans[1000];

int findSample(int n, int C[], int H[], int P[])
{
	int ans=0;

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