Submission #335600

#	Time	Username	Problem	Language	Result	Execution time	Memory
335600		Joshc	Friend (IOI14_friend)	C++11	100 / 100	33 ms	3436 KiB

friend

#include <algorithm>
using namespace std;

#define f first
#define s second
pair<int, int> dp[100001];

int findSample(int n, int confidence[], int host[], int protocol[]) {
    for (int i=0; i<n; i++) dp[i] = {confidence[i], 0};
    for (int i=n-1; i>0; i--) {
        int j = host[i], type = protocol[i];
        if (type == 0) dp[j] = {dp[j].f+dp[i].s, dp[j].s+max(dp[i].f, dp[i].s)};
        else if (type == 1) dp[j] = {max(dp[j].f+max(dp[i].f, dp[i].s), dp[i].f+dp[j].s), dp[i].s+dp[j].s};
        else dp[j] = {max(dp[j].f+dp[i].s, dp[i].f+dp[j].s), dp[i].s+dp[j].s};
    }
    return max(dp[0].f, dp[0].s);
}

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