oj.uz

Submission #994403

# Submission time Handle Problem Language Result Execution time Memory
994403 2024-06-07T14:28:57 Z LOLOLO Biochips (IZhO12_biochips) C++17
100 / 100
 458 ms 400980 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 2e5 + 10;
vector <int> ed[N];
int sz[N], a[N];
int f[N][501];
int n, m;

void dfs(int u) {
    f[u][0] = 0;
    sz[u] = 1;
    for (auto x : ed[u]) {
        dfs(x);
        sz[u] += sz[x];

        for (int i = min(sz[u], m); i >= 1; i--) {
            for (int j = max(0, i - sz[u] + sz[x]); j <= sz[x] && j <= i; j++) {
                if (f[x][j] == -1)
                    continue;

                f[u][i] = max(f[u][i], f[x][j] + f[u][i - j]);
            }
        }
    }

    f[u][1] = max(f[u][1], a[u]);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    mem(f, -1);
    cin >> n >> m;

    int root = 0;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x >> a[i];
        if (x) {
            ed[x].pb(i);
        } else {
            root = i;
        }
    }

    dfs(root);

    cout << f[root][m] << '\n';

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 398676 KB Output is correct
2 Correct 107 ms 398812 KB Output is correct
3 Correct 106 ms 398676 KB Output is correct
4 Correct 114 ms 398932 KB Output is correct
5 Correct 110 ms 399096 KB Output is correct
6 Correct 113 ms 398928 KB Output is correct
7 Correct 242 ms 400972 KB Output is correct
8 Correct 257 ms 400976 KB Output is correct
9 Correct 356 ms 400972 KB Output is correct
10 Correct 458 ms 400980 KB Output is correct