Submission #313465

#	Time	Username	Problem	Language	Result	Execution time	Memory
313465		kylych03	Friend (IOI14_friend)	C++14	0 / 100	2 ms	2728 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
// Find out best sample
bool f[3];
vector <int> g[100001];
int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans=10, sum=0, mx=0;

	for(int i = 0 ; i < n-1;i++){
        f[protocol[i]]=true;
	}
	for(int i =0; i < n; i++){
        sum +=confidence[i];
        mx = max(mx, confidence[i] );
	}
	if(!f[0] && !f[2])
        return sum;
    if(!f[0] && !f[1])
        return mx;
    if(n<=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