Submission #136333

#	Time	Username	Problem	Language	Result	Execution time	Memory
136333		BThero	Chase (CEOI17_chase)	C++17	40 / 100	4050 ms	332040 KiB

chase

// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << '\n';

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)1e5 + 5;
const ll INF = (ll)1e15;

ll dp[2][105][MAXN], dp2[2][105][MAXN];

vector<int> adj[MAXN];

ll neigh[MAXN];

int arr[MAXN];

int n, lim;

ll ans;

void upd(ll &a, ll b) {
    if (b > a) {
        a = b;
    }
}

void dfs(int v, int pr = -1) {
    for (int s = 0; s < 2; ++s) {
        for (int k = 0; k <= lim; ++k) {
            dp[s][k][v] = -INF;
            dp2[s][k][v] = -INF;
        }
    }
    
    dp2[0][0][v] = 0;
    dp2[1][1][v] = neigh[v]; 

    for (int to : adj[v]) {
        if (to != pr) {
            dfs(to, v);
            
            for (int k = 0; k <= lim; ++k) {
                upd(dp2[0][k][v], max(dp2[1][k][to], dp2[0][k][to]));
                upd(dp2[1][k + 1][v], max(dp2[0][k][to], dp2[1][k][to]) + neigh[v] - arr[to]);
            }
        }
    }
    
    for (int step = 0; step < 2; ++step) {
        for (int s = 0; s < 2; ++s) {
            for (int k = 0; k <= lim; ++k) {
                dp[s][k][v] = -INF;
            }
        }
        
        dp[0][0][v] = 0;
        dp[1][1][v] = neigh[v];
        
        for (int to : adj[v]) {
            if (to != pr) {
                for (int a = 0; a <= lim; ++a) {
                    for (int b = 0; a + b <= lim; ++b) {
                        upd(ans, dp[0][a][v] + dp2[1][b][to]);
                        upd(ans, dp[0][a][v] + dp2[0][b][to]);
                        upd(ans, dp[1][a][v] + dp2[1][b][to] - arr[to]);
                        upd(ans, dp[1][a][v] + dp2[0][b][to] - arr[to]);
                    }
                }
                
                for (int k = 0; k <= lim; ++k) {
                    upd(dp[0][k][v], max(dp[1][k][to] - arr[v], dp[0][k][to]));
                    upd(dp[1][k + 1][v], max(dp[0][k][to], dp[1][k][to] - arr[v]) + neigh[v]);
                }
            }
        }
        
        reverse(all(adj[v]));
    }
}

void solve() {
    scanf("%d %d", &n, &lim);
    
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &arr[i]);
    }
    
    for (int i = 1; i < n; ++i) {
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].pb(v);
        adj[v].pb(u);
        neigh[u] += arr[v];
        neigh[v] += arr[u];
    }
    
    dfs(1);

    for (int s = 0; s < 2; ++s) {
        for (int k = 0; k <= lim; ++k) {
            for (int i = 1; i <= n; ++i) {
                upd(ans, dp[s][k][i]);
                upd(ans, dp2[s][k][i]);
            }
        }
    }
    
    printf("%lld\n", ans);
}

int main() {
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message (stderr)

chase.cpp: In function 'void solve()':
chase.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &lim);
     ~~~~~^~~~~~~~~~~~~~~~~~~
chase.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
chase.cpp:110:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

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