Submission #877635

#TimeUsernameProblemLanguageResultExecution timeMemory
877635noiaintDostavljač (COCI18_dostavljac)C++17
14 / 140
198 ms4056 KiB
#include <bits/stdc++.h> #define int long long using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #endif #define file "" #define mp make_pair #define fi first #define se second #define all(x) x.begin(), x.end() #define bit(x) (1LL << (x)) #define getbit(x, i) (((x) >> (i)) & 1) #define popcount __builtin_popcountll mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count()); int rand(int l, int r) { return l + rd() % (r - l + 1); } const int N = 5e2 + 5; const int mod = (int)1e9 + 7; // 998244353; const int lg = 25; // lg + 1 const int oo = 1e9; const long long ooo = 1e18; template<class X, class Y> bool mini(X &a, Y b) { return a > b ? (a = b, true) : false; } template<class X, class Y> bool maxi(X &a, Y b) { return a < b ? (a = b, true) : false; } void add(int &a, int b) { a += b; if (a >= mod) a -= mod; if (a < 0) a += mod; } int n, m; vector<int> adj[N]; int a[N]; int f[N][N][2]; void dfs(int u, int p) { f[u][1][0] = a[u]; for (int v : adj[u]) if (v != p) { dfs(v, u); for (int i = m; i >= 0; --i) for (int j = 0; j <= m; ++j) { if (i + j + 1 <= m) { maxi(f[u][i + j + 1][1], f[u][i][0] + max(f[v][j][0], f[v][j][1])); } if (i + j + 2 <= m) { maxi(f[u][i + j + 2][0], f[u][i][0] + f[v][j][0]); maxi(f[i][i + j + 2][1], f[u][i][1] + f[v][j][0]); } } } } void process() { 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].push_back(v); adj[v].push_back(u); } dfs(1, 0); int res = 0; for (int i = 0; i <= m; ++i) { maxi(res, f[1][i][0]); maxi(res, f[1][i][1]); } cout << res; } signed main() { ios::sync_with_stdio(false); cin.tie(0); // freopen(file".inp", "r", stdin); // freopen(file".out", "w", stdout); int tc = 1; // cin >> tc; while (tc--) { process(); } return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...