Submission #1296683

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296683		Namnamseo	Friend (IOI14_friend)	C++17	100 / 100	15 ms	2176 KiB

friend

#include <algorithm>
using namespace std;
using ll=long long;
const int maxn = int(1e5) + 10;

int findSample(int n, int confidence[], int host[], int protocol[]) {
    static ll weight[maxn];
    for (int i=0; i<n; ++i) weight[i] = confidence[i];

    ll base = 0;
    for (int i=n-1; 0<i; --i) {
        int h = host[i];
        if (protocol[i] == 0) {
            base += weight[i];
            weight[h] -= weight[i];
            weight[h] = max(weight[h], 0ll);
        } else if (protocol[i] == 1) {
            weight[h] += weight[i];
        } else {
            weight[h] = max(weight[h], weight[i]);
        }
    }

    return base + weight[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