Submission #874119

#	Time	Username	Problem	Language	Result	Execution time	Memory
874119		itslq	Friend (IOI14_friend)	C++17	8 / 100	1094 ms	348 KiB

friend

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

vector<int> children[1005];
long long dp(int w[], int id, bool t) {
    long long s = 0;
    if (t == 0) {
        for (int c: children[id]) {
            s += max(dp(w, c, 1), dp(w, c, 0));
        }
    } else {
        s += w[id];
        for (int c: children[id]) {
            s += dp(w, c, 0);
        }
    }
    return s;
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
    if (protocol[1] == 0) {
        for (int i = 1; i < n; i++) children[host[i]].push_back(i);
        return max(dp(confidence, 0, 0), dp(confidence, 0, 1));
    } else if (protocol[1] == 2) {
        int m = -1;
        for (int i = 0; i < n; i++) m = max(m, confidence[i]);
        return m;
    }
    return -1;
}

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