#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key (k) : Number of items strictly smaller than k .
// find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll
const int N = 2e5 + 5;
const int oo = 1e9 + 5;
int n, m, root, val[N], sz[N], dp[N][505];
vector <int> g[N];
void dfs(int v, int pr) {
if (!sz(g[v])) { sz[v] = 1; }
for (int to : g[v]) {
if (to == pr) { continue; }
dfs(to, v);
sz[v] += sz[to];
for (int i = min(sz[v], m); i >= 1; --i) {
dp[v][i] = max(dp[v][i], dp[to][i]);
for (int j = i-1; j >= 1; --j) {
dp[v][i] = max(dp[v][i], dp[v][j] + dp[to][i-j]);
}
}
}
dp[v][1] = max(dp[v][1], val[v]);
}
void solve() {
cin >> n >> m;
for (int a = 1; a <= n; ++a) {
int b, c;
cin >> b >> c;
if (b == 0) { root = a; }
else {
g[b].pb(a);
val[a] = c;
}
}
dfs(root, -1);
cout << dp[root][m];
}
main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
//cin >> tests;
while (tests --) {
solve();
}
return 0;
}
/*
Just Chalish!
*/
Compilation message
biochips.cpp:77:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
77 | main () {
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
5100 KB |
Output is correct |
2 |
Correct |
4 ms |
5100 KB |
Output is correct |
3 |
Correct |
4 ms |
5228 KB |
Output is correct |
4 |
Correct |
20 ms |
22892 KB |
Output is correct |
5 |
Correct |
23 ms |
25068 KB |
Output is correct |
6 |
Correct |
25 ms |
25068 KB |
Output is correct |
7 |
Execution timed out |
2083 ms |
270524 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |