# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856338 | Cyanmond | Chase (CEOI17_chase) | C++17 | 0 ms | 0 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 rep(i, l, r) for (int i = (l); i < (r); ++i)
#define per(i, l, r) for (int i = (r - 1); i >= l; --i)
#define ALL(x) (x).begin(), (x).end()
using i64 = long long;
constexpr i64 inf = 1ll << 60;
void main_() {
int N, V;
cin >> N >> V;
if (V == 0) {
cout << 0 << endl;
return;
}
vector<i64> P(N);
for (auto &e : P) cin >> e;
vector<int> A(N - 1), B(N - 1);
vector<vector<int>> tree(N);
rep(i, 0, N - 1) {
cin >> A[i] >> B[i];
tree[--A[i]].push_back(--B[i]);
tree[B[i]].push_back(A[i]);
}
i64 ans = 0;
vector dpu(N, vector(V + 1, 0ll)), dpd(N, vector(V + 1, 0ll));