Submission #742714

#	Time	Username	Problem	Language	Result	Execution time	Memory
742714		Blagoj	Friend (IOI14_friend)	C++14	100 / 100	24 ms	2208 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

int p[100005], q[100005];

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