Submission #363946

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
363946	2021-02-07 14:38:25	dolphingarlic	Chase (CEOI17_chase)	C++14	100 / 100	304 ms	155584 KiB

chase

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n, k, p[100001];
vector<int> graph[100001];
ll dp1[100001][101], dp2[100001][101], ans = 0;
void dfs(int node = 1, int parent = 0) {
    ll c_sum = 0;
    for (int i : graph[node]) c_sum += p[i];
    dp2[node][1] = c_sum;
    for (int i : graph[node]) if (i != parent) {
        dfs(i, node);
        for (int j = 1; j <= k; j++) ans = max(ans, dp2[node][j] + dp1[i][k - j]);
        for (int j = 1; j <= k; j++) {
            dp1[node][j] = max({dp1[node][j], dp1[i][j], dp1[i][j - 1] + c_sum - p[parent]});
            dp2[node][j] = max({dp2[node][j], dp2[i][j], dp2[i][j - 1] + c_sum - p[i]});
        }
    }
    fill(dp2[node] + 1, dp2[node] + k + 1, 0);
    dp2[node][1] = c_sum;
    reverse(graph[node].begin(), graph[node].end());
    for (int i : graph[node]) if (i != parent) {
        for (int j = 1; j <= k; j++) ans = max(ans, dp2[node][j] + dp1[i][k - j]);
        for (int j = 1; j <= k; j++)
            dp2[node][j] = max({dp2[node][j], dp2[i][j], dp2[i][j - 1] + c_sum - p[i]});
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 30 / 30