| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 101398 | dwsc | Chase (CEOI17_chase) | C++14 | 140 ms | 9436 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 int long long
using namespace std;
int n,v;
int p[100010];
vector<int> adj[100010];
int dp(int x,int dist,int pa){
// cout << x << " " << dist << " " << pa << '\n';
int ans = 0;
int sum = 0;
for (int i = 0; i < adj[x].size(); i++){
int nx = adj[x][i];
if (nx == pa) continue;
sum += p[nx];
}
// cout << sum << "\n";
if (dist == 0) return sum;
for (int i = 0; i < adj[x].size(); i++){
int nx = adj[x][i];
if (nx== pa) continue;
ans = max(ans,dp(nx,dist-1,x)+sum-p[nx]);
}
return ans;
}
main(){
cin >> n >> v;
for (int i = 0; i < n; i++){
cin >> p[i];
}
for (int i = 0; i < n-1; i++){
int a,b;
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
if (n <= 1000){
int ans = 0;
for (int i = 0; i < n; i++){
// cout << dp(i,v,-1) << "\n";
ans = max(ans,dp(i,v,-1));
}
cout << ans;
}
else cout << dp(0,v,-1);
}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... | ||||
