Submission #115299

#	Time	Username	Problem	Language	Result	Execution time	Memory
115299		faustaadp	친구 (IOI14_friend)	C++17	0 / 100	2 ms	512 KiB

friend

#include "friend.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
// Find out best sample
ll i,n,b[3],a[101010],jum,ma;
int findSample(int n,int confidence[],int host[],int protocol[])
{
	//int ans=10;
	for(i=1;i<n;i++)
	{
		b[protocol[i]]=1;
		a[i]=confidence[i];
		jum+=a[i];
		ma=max(ma,a[i]);
	}
	//if(b[0]==0&&b[1]==1&&b[2]==0)
		return jum;
	if(b[0]==0&&b[1]==0&&b[2]==1)
		return ma;
}

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