제출 #77405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
77405		shoemakerjo	친구 (IOI14_friend)	C++14	100 / 100	38 ms	6684 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans = 0;
	//we will just change confidence values b/c why not

	for (int i = n-1; i > 0; --i) {
		if (protocol[i] == 0) {
			ans += confidence[i];
			confidence[host[i]] = max(0, confidence[host[i]] - confidence[i]);
			//assing a cost to taking the new one (make it 0 if this is never ideal)
		}
		if (protocol[i] == 1) {
			confidence[host[i]] += confidence[i];
		}
		if (protocol[i] == 2) {
			confidence[host[i]] = max(confidence[host[i]], confidence[i]);
		}
	}
	ans += confidence[0];

	return ans;
}

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