oj.uz

Submission #873872

# Submission time Handle Problem Language Result Execution time Memory
873872 2023-11-16T02:25:38 Z noiaint Biochips (IZhO12_biochips) C++17
100 / 100
 167 ms 403648 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#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 = 2e5 + 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 sz[N];
int f[N][505];
int timer = 0;

void dfs(int u) {
	int cur = timer;
	for (int v : adj[u]) dfs(v);
	timer++;
	for (int i = 1; i <= m; ++i) 
		f[timer][i] = max(f[timer - 1][i], f[cur][i - 1] + a[u]);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
    	int p;
    	cin >> p >> a[i];
    	adj[p].push_back(i);
    }

    for (int i = 1; i <= m; ++i) f[0][i] = -oo;
    dfs(0);
    cout << f[timer][m];

    return 0;
}

/*

*/

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7768 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 10076 KB Output is correct
4 Correct 6 ms 26716 KB Output is correct
5 Correct 6 ms 28620 KB Output is correct
6 Correct 7 ms 28624 KB Output is correct
7 Correct 137 ms 301908 KB Output is correct
8 Correct 103 ms 301752 KB Output is correct
9 Correct 135 ms 365904 KB Output is correct
10 Correct 167 ms 403648 KB Output is correct