답안 #676842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676842	2023-01-01T10:43:55 Z	bashkort	친구 (IOI14_friend)	C++17	100 / 100	45 ms	7640 KB

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.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	312 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct

Subtask #3

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	224 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct

Subtask #4

19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	304 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	316 KB	Output is correct

Subtask #5

23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct

Subtask #6

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	304 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	308 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	45 ms	7640 KB	Output is correct
13	Correct	21 ms	3908 KB	Output is correct
14	Correct	35 ms	6864 KB	Output is correct
15	Correct	36 ms	6844 KB	Output is correct