Submission #58614

#	Time	Username	Problem	Language	Result	Execution time	Memory
58614		aome	친구 (IOI14_friend)	C++17	27 / 100	4 ms	760 KiB

friend

#include "friend.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 100005;

int f[N][2];

int findSample(int n, int confidence[], int host[], int protocol[]) {
	for (int i = n - 1; i >= 1; --i) {
		f[i][1] += confidence[i];
		if (protocol[i] == 0) {
			f[host[i]][0] += max(f[i][0], f[i][1]);
			f[host[i]][1] += f[i][0]; 
		}
		if (protocol[i] == 1) {
			f[host[i]][0] += f[i][0];
			f[host[i]][1] += max(f[i][0], f[i][1]);
			f[host[i]][0] = max(f[host[i]][0], f[host[i]][1]);
		}
		if (protocol[i] == 2) return 0;
	}
	f[0][1] += confidence[0];
	return max(f[0][0], f[0][1]);
}

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