# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61779 | IvanC | Chase (CEOI17_chase) | C++17 | 4103 ms | 96120 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;
typedef long long ll;
const int MAXN = 1e5 + 10;
const int MAXC = 1e2 + 5;
vector<int> grafo[MAXN];
ll dp[MAXN][MAXC],P[MAXN],somatorio[MAXN],best;
int N,C;
void dfs(int v,int p){
somatorio[v] = 0;
for(int i = 0;i<=C;i++) dp[v][i] = 0;
for(int u : grafo[v]){
if(u == p) continue;
dfs(u,v);
somatorio[v] += P[u];
}
for(int u : grafo[v]){
if(u == p) continue;
for(int i = 1;i<=C;i++){
dp[v][i] = max(dp[v][i], max(dp[u][i], dp[u][i-1] + somatorio[v] ) );
}
}
}
int main(){
scanf("%d %d",&N,&C);
for(int i = 1;i<=N;i++){
scanf("%lld",&P[i]);
}
for(int i = 1;i<N;i++){
int u,v;
scanf("%d %d",&u,&v);
grafo[u].push_back(v);
grafo[v].push_back(u);
}
for(int i = 1;i<=N;i++){
dfs(i,-1);
for(int j = 0;j<=C;j++) best = max(best,dp[i][j]);
}
printf("%lld\n",best);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |