# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672418 | Alihan_8 | Biochips (IZhO12_biochips) | C++17 | 557 ms | 395056 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
const int N = 2e5+1;
vector <int> g[N];
vector <vector<int>> dp;
void chmax(int &l, int r){l = max(l, r);};
int sub[N], m;
void dfs(int n){
sub[n] = 1;
vector <int> Mx(m+1);
for ( auto to: g[n] ){
dfs(to);
vector <int> cur(m+1);
for ( int i = 0; i <= min(sub[n], m); i++ ){
for ( int j = 0; j <= min(sub[to], m) and j+i <= m; j++ ){
chmax(cur[i+j], Mx[i]+dp[to][j]);
}
}
sub[n] += sub[to];
for ( int i = 0; i <= min(m, sub[n]); i++ ) chmax(Mx[i], cur[i]);
}
for ( int i = 0; i <= min(m, sub[n]); i++ ) chmax(dp[n][i], Mx[i]);
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n >> m;
int root = -1;
dp.resize(n+1);
for ( auto &i: dp ) i.resize(m+1);
for ( int i = 1; i <= n; i++ ){
int x; cin >> x >> dp[i][1];
if ( x ) g[x].pb(i);
else root = i;
}
dfs(root);
cout << dp[root][m];
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |