Submission #404186

#TimeUsernameProblemLanguageResultExecution timeMemory
404186Kenzo_1114Friend (IOI14_friend)C++17
0 / 100
1 ms204 KiB
#include<bits/stdc++.h>
#include"friend.h"
using namespace std;
const int MAXN = 100010;

int n, c[MAXN], h[MAXN], p[MAXN];

/*
	0 : IAmYourFriend
	1 : MyFriendsAreYourFriends
	2 : WeAreYourFriends
*/

int task3()
{
	int ans = 0;
	for(int i = 0; i < n; i++)
	{
		if(p[i] != 2)	return 0;
		ans = max(ans, c[i]);
	}

	return ans;
}

int findSample(int N, int Confidence[], int Host[], int Protocol[])
{
	n = N;
	for(int i = 0; i < N; i++)	c[i] = Confidence[i];
	for(int i = 0; i < N; i++)	h[i] = Host[i];
	for(int i = 0; i < N; i++)	p[i] = Protocol[i];

	return task3();
}
#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...