제출 #676842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676842		bashkort	친구 (IOI14_friend)	C++17	100 / 100	45 ms	7640 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]) {
    vector<vector<pair<int, int>>> g(n);

    for (int i = 1; i < n; ++i) {
        g[host[i]].emplace_back(i, protocol[i]);
    }

    vector dp(n, array<int, 2>{});
    //dp[i][0] - don't take neither i nor neighbours of i;
    //dp[i][1] - max(dp[i][0], "take some of neighbours, and maybe i")

    for (int i = n - 1; i >= 0; --i) {
        for (auto [to, type] : g[i]) {
            if (type == 0) {
                dp[i][0] += dp[to][1];
            } else {
                dp[i][0] += dp[to][0];
            }
        }

        //take i
        dp[i][1] = confidence[i];
        for (auto [to, type] : g[i]) {
            if (type == 0 || type == 2) {
                dp[i][1] += dp[to][0];
            } else {
                dp[i][1] += dp[to][1];
            }
        }

        //don't take i
        vector<int> suf(g[i].size() + 1);
        for (int j = int(g[i].size()) - 1; j >= 0; --j) {
            suf[j] = suf[j + 1];

            auto [to, type] = g[i][j];

            if (type == 1 || type == 2) {
                suf[j] += dp[to][0];
            } else {
                suf[j] += dp[to][1];
            }
        }

        int sum0 = 0, sum_good = 0;
        for (int j = 0; j < int(g[i].size()); ++j) {
            auto [to, type] = g[i][j];

            sum0 += dp[to][0];

            if (type == 1) {
                sum_good += dp[to][1] - dp[to][0];
            } else if (type == 2) {
                dp[i][1] = max(dp[i][1], suf[j + 1] + sum0 + sum_good + dp[to][1] - dp[to][0]);
            }

            dp[i][1] = max(dp[i][1], suf[j + 1] + sum0 + sum_good);
        }

        dp[i][1] = max(dp[i][0], dp[i][1]);
    }

    return dp[0][1];
}

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