# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44694 | bogdan10bos | Chase (CEOI17_chase) | C++14 | 304 ms | 137524 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;
//#define FILE_IO
typedef long long LL;
LL ans;
int N, K;
int v[100005];
LL vec[100005];
LL dpup[100005][105][3];
vector<int> edg[100005];
void DFS(int nod, int fth)
{
for(auto nxt: edg[nod])
{
if(nxt == fth) continue;
DFS(nxt, nod);
for(int i = 0; i <= K; i++)
{
dpup[nod][i][0] = max({ dpup[nod][i][0], dpup[nxt][i][0], dpup[nxt][i][1] });
dpup[nod][i][1] = max({ dpup[nod][i][1], dpup[nxt][i][2] });
if(i > 0) dpup[nod][i][2] = max({ dpup[nod][i][2], dpup[nxt][i - 1][0] + vec[nod], dpup[nxt][i - 1][1] + vec[nod] - v[nxt], dpup[nxt][i - 1][2] + vec[nod] - v[nxt] });
ans = max({ ans, dpup[nod][i][0], dpup[nod][i][1], dpup[nod][i][2] });
}
}
}
int main()
{
#ifdef FILE_IO
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
scanf("%d%d", &N, &K);
for(int i = 1; i <= N; i++) scanf("%d", &v[i]);
for(int i = 1; i < N; i++)
{
int x, y;
scanf("%d%d", &x, &y);
edg[x].push_back(y);
edg[y].push_back(x);
vec[x] += v[y];
vec[y] += v[x];
}
ans = 0;
DFS(1, 0);
printf("%lld\n", ans);
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... |