Submission #108980

#	Time	Username	Problem	Language	Result	Execution time	Memory
108980		dantoh000	Friend (IOI14_friend)	C++14	100 / 100	41 ms	2680 KiB

friend

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

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