# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673333 | smartmonky | Biochips (IZhO12_biochips) | C++14 | 248 ms | 290980 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>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
const int N = 200005;
vector <int> g[N];
int coast[N], dp[500][N];
int m;
void dfs(int v){
for(auto to : g[v]){
dfs(to);
for(int i = m; i > 0; i--){
dp[i][v] = max(dp[i - 1][v] + dp[1][to], dp[i][v]);
}
}
dp[1][v] = max(dp[1][v], coast[v]);
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//fp("game");
int n;
cin >> n >> m;
int ind = -1;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
coast[i + 1] = b;
if(a == 0){
ind = i + 1;
continue;
}
g[a].pb(i + 1);
}
dfs(ind);
cout << dp[m][ind];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |