Submission #108981

#	Time	Username	Problem	Language	Result	Execution time	Memory
108981		dantoh000	Friend (IOI14_friend)	C++14	58 / 100	31 ms	2296 KiB

friend

//#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
int findSample(int n, int confidence[], int host[], int protocol[]) {
    int p[n], q[n];
    for (int i = 0; i < n; i++){
        p[i] = confidence[i];
        q[i] = 0;
    }
    for (int i = n-1; i >= 1; i--){
        int v = host[i];
        if (protocol[i] == 0){
            p[v] += q[i];
            q[v] += max(p[i],q[i]);
        }
        if (protocol[i] == 1){
            p[v] = max(p[i]+p[v],max(p[i]+q[v],q[i]+p[v]));
            q[v] += q[i];
        }
        if (protocol[i] == 2){
            q[v] += q[i];
            p[v] = max(p[i]+q[v],q[i]+p[v]);
        }
        //printf("%d %d %d %d\n",i,v,p[v],q[v]);
    }
    return max(p[0],q[0]);
}

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