Submission #302542

#	Time	Username	Problem	Language	Result	Execution time	Memory
302542		kevinsogo	친구 (IOI14_friend)	C++17	100 / 100	34 ms	3072 KiB

friend

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

int findSample(int n, int conf[], int host[], int prot[]) {
    vector<int> omit(n);
    for (int i = n; --i;) {
        int j = host[i];
        conf[j] += prot[i] == 1 ? conf[i] : max(omit[i], omit[j] + conf[i] - conf[j]);
        omit[j] += prot[i] == 0 ? conf[i] : omit[i];
        conf[j] = max(conf[j], omit[j]);
    }
    return conf[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