Submission #104242

#	Time	Username	Problem	Language	Result	Execution time	Memory
104242		alexpetrescu	Friend (IOI14_friend)	C++14	100 / 100	62 ms	8184 KiB

friend

#include "friend.h"
#include <algorithm>
#include <vector>

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
    std::vector < std::vector < int > > d(n, std::vector < int > (2, 0));
	for (int i = 0; i < n; i++)
        d[i][1] = confidence[i];
    for (int i = n - 1; i > 0; i--) {
        int x = host[i];
        if (protocol[i] == 0) {
            d[x][0] += std::max(d[i][1], d[i][0]);
            d[x][1] += d[i][0];
        } else if (protocol[i] == 1) {
            d[x][1] = std::max(std::max(d[x][1] + d[i][1], d[x][1] + d[i][0]), d[x][0] + d[i][1]);
            d[x][0] += d[i][0];
        } else {
            d[x][1] = std::max(d[x][0] + d[i][1], d[x][1] + d[i][0]);
            d[x][0] += d[i][0];
        }
    }
    return std::max(d[0][1], d[0][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