#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) {
sz[u] = 1;
for (auto x : ed[u]) {
dfs(x);
sz[u] += sz[x];
for (int i = min(sz[u], m); i >= max(1, sz[u] - sz[x] - m); i--) {
for (int j = 0; j <= sz[x] && j <= i; j++) {
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);
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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
6748 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
6748 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
6748 KB |
Output isn't correct |
| 4 |
Incorrect |
11 ms |
24248 KB |
Output isn't correct |
| 5 |
Incorrect |
12 ms |
26324 KB |
Output isn't correct |
| 6 |
Incorrect |
12 ms |
26456 KB |
Output isn't correct |
| 7 |
Incorrect |
190 ms |
296916 KB |
Output isn't correct |
| 8 |
Incorrect |
221 ms |
297040 KB |
Output isn't correct |
| 9 |
Incorrect |
244 ms |
360616 KB |
Output isn't correct |
| 10 |
Incorrect |
291 ms |
397908 KB |
Output isn't correct |
