Submission #1150066

#TimeUsernameProblemLanguageResultExecution timeMemory
1150066BlockOGFriend (IOI14_friend)C++20
0 / 100
1 ms584 KiB
#include "friend.h"
#include <vector>

// meow meow meow mewo mrrow nya nya :3c
// go play vivid/stasis! it's very awesome gmae on steam

using namespace std;

vector<int> friends[10000];

pair<int, int> dfs(int i, int l, int confidence[]) {
    int res1 = 0, res2 = 0;

    for (int j : friends[i]) {
        if (j == l) continue;
        auto [a, b] = dfs(j, i, confidence);

        if (a > res2) res2 = a;
        if (b > res2) res2 = b;
        if (b > res1) res1 = b;
    }

    return {res1 + confidence[i], res2};
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
    // if (n > 10) return 0;

    for (int i = 1; i < n; i++) friends[host[i]].push_back(i), friends[i].push_back(host[i]);

    auto [a, b] = dfs(0, -1, confidence);
    return a > b ? a : b;
}
#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...