Submission #302542

#TimeUsernameProblemLanguageResultExecution timeMemory
302542kevinsogoFriend (IOI14_friend)C++17
100 / 100
34 ms3072 KiB
#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];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...