# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701000 | Do_you_copy | Dostavljač (COCI18_dostavljac) | C++17 | 209 ms | 4196 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 fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int maxN = 506 + 1;
const int inf = 0x3f3f3f3f;
//const int Mod =
int n, m;
int a[maxN];
vector <int> adj[maxN];
ll dp[maxN][maxN][2];
int sz[maxN];
void dfs(int u, int p){
sz[u] = 1;
for (int i: adj[u]){
if (i == p) continue;
dfs(i, u);
sz[u] += sz[i];
vector <ll> tem[2];
tem[0].resize(m + 1, 0);
tem[1].resize(m + 1, 0);
for (int j = 0; j <= m; ++j){
for (int k = 0; k < j; ++k){
if (j - k > 1) tem[0][j] = max(tem[0][j], dp[u][j - k - 2][0] + dp[i][k][0]);
tem[1][j] = max(tem[1][j], dp[u][j - k - 1][0] + dp[i][k][1]);
}
}
for (int j = 0; j <= m; ++j){
dp[u][j][0] = tem[0][j];
dp[u][j][1] = tem[1][j];
}
// cerr << u << " " << i << "\n";
}
for (int j = m; j >= 1; --j){
dp[u][j][0] = max(dp[u][j][0], dp[u][j - 1][0] + a[u]);
dp[u][j][1] = max(dp[u][j][1], dp[u][j - 1][1] + a[u]);
}
//for (int j = 0; j <= m; ++j){
//cerr << u << " " << j << " " << dp[u][j][0] << " " << dp[u][j][1] << "?\n";
//}
}
void Init(){
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i < n; ++i){
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(1, 0);
ll ans = 0;
for (int i = 0; i <= m; ++i) ans = max(ans, dp[1][i][1]);
cout << ans;
}
#define taskname "test"
signed main(){
faster
if (fopen(taskname ".inp", "r")){
freopen(taskname ".inp", "r", stdin);
freopen(taskname ".out", "w", stdout);
}
int tt = 1;
//cin >> tt;
while (tt--){
Init();
}
if (fopen("timeout.txt", "r")){
ofstream timeout("timeout.txt");
cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
timeout.close();
}
}
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |