Submission #1288799

#	Time	Username	Problem	Language	Result	Execution time	Memory
1288799		Faisal_Saqib	Friend (IOI14_friend)	C++17	0 / 100	1 ms	576 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+100;
int sm=0,smp=0,tp[N];
int findSample(int n,int confidence[],int host[],int protocol[]){
	set<int> cur;
	for(int i=1;i<n;i++)cur.insert(protocol[i]);
	if(cur.size()==1)
	{
		if((*begin(cur))==0)
		{
			tp[0]=0;
			sm=smp=confidence[0];
			for(int i=1;i<n;i++)
			{
				sm+=confidence[i];
				tp[i]=1-tp[host[i]];
				if(!tp[i])smp+=confidence[i];
			}
			return max(sm,sm-smp);
		}
		else if((*begin(cur))==1)
		{
			sm=confidence[0];
			for(int i=0;i<n;i++)sm=max(sm,confidence[i]);
			return sm;
		}
		else
		{
			sm=0;
			for(int i=0;i<n;i++)
			{
				sm+=confidence[i];
			}
			return sm;
		}
	}
	int ans=10;
	return ans;
}

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