# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309858 | peuch | Chase (CEOI17_chase) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const int MAXB = 110;
int n, b;
long long val[MAXN], sum[MAXN], pai[MAXN];
long long dp[MAXN][MAXB];
vector<int> ar[MAXN];
void calcDP(int cur);
int main(){
scanf("%d %d", &n, &b);
for(int i = 1; i <= n; i++)
scanf("%d", &val[i]);
for(int i = 1; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
ar[a].push_back(b);
ar[b].push_back(a);
sum[a] += val[b];
sum[b] += val[a];
}
long long ans = 0;
pai[1] = 0;
calcDP(1);
ans = max(ans, dp[i][b]);
printf("%lld\n", ans);
}
void calcDP(int cur){
for(int j = 0; j <= b; j++)
dp[cur][j] = 0;
for(int i = 0; i < ar[cur].size(); i++){
int viz = ar[cur][i];
if(viz == pai[cur]) continue;
pai[viz] = cur;
calcDP(viz);
}
for(int i = 0; i < ar[cur].size(); i++){
int viz = ar[cur][i];
if(viz == pai[cur]) continue;
dp[cur][0] = max(dp[cur][0], dp[viz][0]);
for(int j = 1; j <= b; j++){
dp[cur][j] = max(dp[cur][j], dp[viz][j - 1] + sum[cur] - val[pai[cur]]);
dp[cur][j] = max(dp[cur][j], dp[viz][j]);
}
}
}
/*
12 2
2 3 3 8 1 5 6 7 8 3 5 4
2 1
2 7
3 4
4 7
7 6
5 6
6 8
6 9
7 10
10 11
10 12
10 1
1 2 3 4 5 6 7 8 9 9
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
8 10
*/