Submission #416438

#	Time	Username	Problem	Language	Result	Execution time	Memory
416438		mjhmjh1104	Friend (IOI14_friend)	C++17	16 / 100	1 ms	204 KiB

friend

#include "friend.h"
#include <algorithm>
using namespace std;

int uf[1006], mx[1006];

int _find(int x) {
	if (uf[x] == -1) return x;
	return uf[x] = _find(uf[x]);
}

void _merge(int x, int y) {
	x = _find(x), y = _find(y);
	if (x != y) uf[x] = y, mx[y] = max(mx[y], mx[x]);
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
	if (protocol[1] == 1) {
		int res = 0;
		for (int i = 0; i < n; i++) res += confidence[i];
		return res;
	} else if (protocol[1] == 2) {
		int res = 0;
		for (int i = 0; i < n; i++) res = max(res, confidence[i]);
		return res;
	} else {
		int res = 0;
		for (int i = 0; i < n; i++) uf[i] = -1, mx[i] = confidence[i];
		for (int i = 1; i < n; i++) _merge(host[i], i);
		for (int i = 0; i < n; i++) if (uf[i] == -1) res += mx[i];
		return res;
	}
}

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