# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122558 | sofhiasouza | Chase (CEOI17_chase) | C++14 | 279 ms | 82168 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>
#define pb push_back
using namespace std;
typedef long long int ll;
const int maxn = 1e5+10;
vector < int > grafo[maxn];
int n, v, vet[maxn];
ll soma[maxn], dp[maxn][110];
void dfs(int u, int pai)
{
for(int i = 0 ; i < grafo[u].size() ; i++)
{
int k = grafo[u][i];
if(k == pai) continue;
dfs(k, u);
for(int j = 1 ; j <= v ; j++)
{
dp[u][j] = max({dp[u][j], dp[k][j-1] + soma[k] - vet[u], dp[k][j]});
}
}
}
int main()
{
cin >> n >> v;
for(int i = 1 ; i <= n ; i++) cin >> vet[i];
for(int i = 0 ; i < n-1 ; i++)
{
int a, b;
cin >> a >> b;
grafo[a].pb(b);
grafo[b].pb(a);
}
for(int i = 1 ; i <= n ; i++)
{
for(int j = 0 ; j < grafo[i].size() ; j++)
{
soma[i] += vet[grafo[i][j]];
}
}
grafo[0].pb(1);
dfs(0, 0);
cout << dp[0][v] << endl;
}
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... |