Submission #589356

#	Time	Username	Problem	Language	Result	Execution time	Memory
589356		yutabi	Friend (IOI14_friend)	C++14	0 / 100	1 ms	212 KiB

friend

#include "friend.h"


#include <bits/stdc++.h>
using namespace std;


int subtask1(int n,int confidence[],int host[],int protocol[])
{
	return -1;
}

int subtask2(int n,int confidence[],int host[],int protocol[])
{
	int ans=0;

	for(int i=0;i<n;i++)
	{
		ans+=confidence[i];
	}

	return ans;
}

int subtask3(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;
}

int subtask4(int n,int confidence[],int host[],int protocol[])
{
	return -1;
}

int findSample(int n,int confidence[],int host[],int protocol[])
{
	if(n<=10)
	{
		return subtask1(n,confidence,host,protocol);
	}

	if(protocol[0]==1)
	{
		return subtask2(n,confidence,host,protocol);
	}

	if(protocol[0]==2)
	{
		return subtask3(n,confidence,host,protocol);
	}

	if(protocol[0]==0)
	{
		return subtask4(n,confidence,host,protocol);
	}


	bool oopsie=0;

	assert(oopsie);

	return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31