Submission #1083553

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083553		jay22	Friend (IOI14_friend)	C++14	27 / 100	1 ms	856 KiB

friend

#include <algorithm>
 
const int LEN = 1'000'001;
int w[LEN], dp[LEN][2];
 
int findSample(int n, int confidence[], int host[], int protocol[]) {
    for (int i = 0; i < n; ++i) w[i] = confidence[i];
	for (int i = n - 1; i; --i) {
		if (protocol[i] == 0) {
			dp[host[i]][1] += dp[i][0];
			dp[host[i]][0] += std::max(dp[i][0], dp[i][1] + w[i]);
		}
		if (protocol[i] == 1) {
			dp[host[i]][0] += dp[i][0];
			dp[host[i]][1] += std::max(dp[i][0], dp[i][1] + w[i]);
		}
		if (protocol[i] == 2) {
           if (dp[host[i]][0] + dp[i][1] + w[i] > dp[host[i]][1] + w[host[i]] + dp[i][0]) {
              dp[host[i]][1] = dp[host[i]][0] + dp[i][1] + w[i];
             w[host[i]] = w[i];
           } else {
             dp[host[i]][1] = dp[host[i]][1] + w[host[i]] + dp[i][0];
           }
			dp[host[i]][0] += dp[i][0];
		}
	}
    return std::max(dp[0][0], dp[0][1] + w[0]);
}

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