oj.uz

Submission #143486

# Submission time Handle Problem Language Result Execution time Memory
143486 2019-08-14T09:35:01 Z popovicirobert Chase (CEOI17_chase) C++14
50 / 100
 453 ms 246348 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



/*const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}*/

/*int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}*/

using namespace std;

const ll INF = 1e18;
const int MAXN = (int) 1e5;

vector <int> g[MAXN + 1];
int vals[MAXN + 1], v;
ll sum[MAXN + 1];

ll up[MAXN + 1][101], down[MAXN + 1][101];
ll suff[MAXN + 1][101], mx[101];
ll ans = 0;

void dfs(int nod, int par) {

    up[nod][0] = 0;
    up[nod][1] = sum[nod];
    down[nod][0] = 0;
    down[nod][1] = sum[nod] - vals[par];

    vector <int> son;
    int sz = -1;

    for(auto it : g[nod]) {
        if(it != par) {
            dfs(it, nod);

            son.push_back(it);
            sz++;

            for(int i = 0; i <= v; i++) {
                up[nod][i] = max(up[nod][i], up[it][i]);
                if(i > 0) {
                    up[nod][i] = max(up[nod][i], up[it][i - 1] + sum[nod] - vals[it]);
                }
                down[nod][i] = max(down[nod][i], down[it][i]);
                if(i > 0) {
                    down[nod][i] = max(down[nod][i], down[it][i - 1] + sum[nod] - vals[par]);
                    ans = max(ans, down[it][i - 1] + sum[nod]);
                }
                suff[sz][i] = down[it][i];
            }
        }
    }

    for(int i = sz - 1; i >= 0; i--) {
        for(int j = 0; j <= v; j++) {
            suff[i][j] = max(suff[i][j], suff[i + 1][j]);
        }
    }
    for(int i = 0; i <= v; i++) {
        mx[i] = -INF;
    }
    for(int i = 0; i <= sz; i++) {
        int it = son[i];
        ll best = 0;
        for(int j = v; j >= 0; j--) {
            ll cur = mx[j];
            if(i < sz) {
                cur = max(cur, suff[i + 1][j]);
            }
            best = max(best, up[it][v - j]);
            if(v - j > 0) {
                best = max(best, up[it][v - j - 1] + sum[nod] - vals[it]);
            }
            ans = max(ans, cur + best);
        }
        for(int j = 0; j <= v; j++) {
            mx[j] = max(mx[j], down[it][j]);
        }
    }

    for(int i = 1; i <= v; i++) {
        up[nod][i] = max(up[nod][i], up[nod][i - 1]);
        down[nod][i] = max(down[nod][i], down[nod][i - 1]);
    }
    ans = max(ans, max(up[nod][v], down[nod][v]));
}


int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, j, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> v;
    for(i = 1; i <= n; i++) {
        cin >> vals[i];
    }
    for(i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(i = 1; i <= n; i++) {
        for(auto it : g[i]) {
            sum[i] += vals[it];
        }
    }

    for(i = 1; i <= n; i++) {
        for(j = 0; j <= v; j++) {
            up[i][j] = down[i][j] = -INF;
        }
    }

    dfs(1, 0);

    cout << ans;

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 7 ms 4476 KB Output is correct
8 Correct 6 ms 4472 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Incorrect 7 ms 4344 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 173560 KB Output is correct
2 Correct 395 ms 174040 KB Output is correct
3 Correct 435 ms 246348 KB Output is correct
4 Correct 219 ms 166776 KB Output is correct
5 Correct 453 ms 166896 KB Output is correct
6 Correct 398 ms 166848 KB Output is correct
7 Correct 397 ms 166888 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 7 ms 4476 KB Output is correct
8 Correct 6 ms 4472 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Incorrect 7 ms 4344 KB Output isn't correct
11 Halted 0 ms 0 KB -