Submission #1168927

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168927		anmattroi	Friend (IOI14_friend)	C++17	19 / 100	2 ms	2884 KiB

friend

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

vector<int> adj[maxn];
int f[maxn][2];

int findSample(int n, int confidence[], int host[], int protocol[]){
    for (int i = 0; i < n; i++) adj[i].clear();
    for (int i = 1; i < n; i++) adj[host[i]].emplace_back(i);

    function<void(int)> dfs = [&](int u) {
        f[u][0] = 0; f[u][1] = confidence[u];
        for (int v : adj[u]) {
            dfs(v);
            f[u][0] += max(f[v][0], f[v][1]);
            f[u][1] += f[v][0];
        }
    };

    dfs(0);

    return max(f[0][0], f[0][1]);
}

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