제출 #1004761

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1004761		tvladm2009	Chase (CEOI17_chase)	C++17	100 / 100	156 ms	165288 KiB

chase

// https://oj.uz/submission/945337
#include <iostream> // am dat o simulare pe vjudge mai demult si am bagat pb asta, o urc si pe main
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int MAXN = 100228;
const int MAXV = 100 + 7;
 
int n, k, a[MAXN];
vector<int> g[MAXN];
ll dp1[MAXN][MAXV], dp2[MAXN][MAXV];
ll res = 0;
 
void dfs(int u, int p = 0) {
    ll s = 0;
    for (auto h: g[u]) {
        s += a[h];
    }
    vector<int> kids;
    dp2[u][1] = s;
    for (auto h: g[u]) {
        if (h == p) {
            continue;
        }
        kids.pb(h);
        dfs(h, u);
        for (int i = 1; i <= k; i++) {
            chkmax(res, dp2[u][i] + dp1[h][k - i]);
        }
        for (int i = 1; i <= k; i++) {
            chkmax(dp1[u][i], max(dp1[h][i], dp1[h][i - 1] + s - a[p]));
            chkmax(dp2[u][i], max(dp2[h][i], dp2[h][i - 1] + s - a[h]));
        }
    }
    for (int i = 1; i <= k; i++) {
        dp2[u][i] = 0;
    }
    dp2[u][1] = s;
    reverse(all(kids));
    for (auto h: kids) {
        for (int i = 1; i <= k; i++) {
            chkmax(res, dp2[u][i] + dp1[h][k - i]);
        }
        for (int i = 1; i <= k; i++) {
            chkmax(dp2[u][i], max(dp2[h][i], dp2[h][i - 1] + s - a[h]));
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(1);
    cout << res << '\n';
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 30 / 30