Submission #857242

#	Time	Username	Problem	Language	Result	Execution time	Memory
857242		ntkphong	Friend (IOI14_friend)	C++14	100 / 100	20 ms	2908 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXSIZE = 1e5 + 10;

int findSample(int n, int confidence[], int host[], int protocol[]) {
    vector<int> p(n, 0);
    vector<int> q(n, 0);
    
    for(int i = 0; i < n; i ++) q[i] = confidence[i];
    
    for(int i = n - 1; i > 0; i --) {
        int j = host[i];
        
        if(protocol[i] == 0) {
            p[j] = max(p[j] + p[i], p[j] + q[i]);
            q[j] = q[j] + p[i];
        }
        
        if(protocol[i] == 1) {
            q[j] = max({q[j] + p[i], q[j] + q[i], p[j] + q[i]});
            p[j] = p[j] + p[i];
        }
        
        if(protocol[i] == 2) {
            q[j] = max(q[j] + p[i], p[j] + q[i]);
            p[j] = p[j] + p[i];
        }
    }
    
    return max(p[0], q[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