Submission #363556

#	Time	Username	Problem	Language	Result	Execution time	Memory
363556		silverfish	Friend (IOI14_friend)	C++14	16 / 100	1 ms	364 KiB

friend

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

// Find out best sample
int findSample(int n,int conf[],int host[],int protocol[]){
	bool subtask2 = 1, subtask3 = 1;
	for(int i = 1; i < n; ++i){
		if(protocol[i] != 1) subtask2 = 0;
		if(protocol[i] != 2) subtask3 = 0;
	}
	if(subtask2){
		long long ans = 0;
		for(int i = 0; i < n; ++i) ans += 1LL*conf[i];
		return ans;
	}
	if(subtask3){
		return *max_element(conf, conf+n);
	}
	return -1;
}

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