답안 #154709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
154709	2019-09-23T18:25:59 Z	dolphingarlic	친구 (IOI14_friend)	C++14	58 / 100	65 ms	7032 KB

friend

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

int colour[100001], dp[2][100001], c[100001];
vector<int> graph[100001];

void dfs(int node) {
    dp[0][node] = c[node];
    for (int i : graph[node]) {
        dfs(i);
        if (!colour[i])
            dp[1][node] += dp[0][i], dp[0][node] += dp[1][i];
        else if (colour[i] == 1)
            dp[0][node] += dp[0][i], dp[1][node] += dp[1][i];
        else
            dp[1][node] += dp[1][i];
    }
    int curr = dp[1][node];
    dp[0][node] = max(dp[0][node], curr);

    for (int i : graph[node]) {
        if (!colour[i])
            curr += dp[1][i] - dp[0][i];
        else 
            curr += dp[0][i] - dp[1][i];
        dp[0][node] = max(dp[0][node], curr);
        if (colour[i] == 2) curr += dp[1][i] - dp[0][i];
    }
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
    c[0] = confidence[0];
    for (int i = 1; i < n; i++) {
        c[i] = confidence[i];
        colour[i] = protocol[i];
        graph[host[i]].push_back(i);
    }
    dfs(0);
    return dp[0][0];
}

Subtask #1

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	4 ms	2680 KB	Output is correct
4	Correct	4 ms	2808 KB	Output is correct
5	Correct	5 ms	2680 KB	Output is correct
6	Correct	4 ms	2680 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	4 ms	2684 KB	Output is correct
12	Correct	4 ms	2680 KB	Output is correct
13	Correct	4 ms	2680 KB	Output is correct
14	Correct	4 ms	2680 KB	Output is correct
15	Incorrect	4 ms	2680 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

8.0 / 8.0

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

Subtask #3

8.0 / 8.0

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

Subtask #4

19.0 / 19.0

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

Subtask #5

23.0 / 23.0

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

Subtask #6

0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	5 ms	2684 KB	Output is correct
3	Correct	4 ms	2680 KB	Output is correct
4	Correct	5 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2680 KB	Output is correct
7	Correct	5 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	5 ms	2680 KB	Output is correct
12	Incorrect	65 ms	7032 KB	Output isn't correct
13	Halted	0 ms	0 KB	-