# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
513729 | Aktan | Biochips (IZhO12_biochips) | C++17 | 274 ms | 524292 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;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define ft first
#define sc second
using namespace std;
const int mod=1e9+7,INF=1e17;
vector<int> v[200005];
int a[200005],b[200005],d[200005];
int tout[200005],dp[200005][505],tin=1;
void dfs(int x){
int y=tin;
for(auto w : v[x]){
dfs(w);
}
d[tin]=b[x];
tout[tin++]=y;
}
main(){
int n,m;
cin >> n >> m;
for(int i=1;i<=n;i++){
cin >> a[i] >> b[i];
v[a[i]].push_back(i);
}
dfs(0);
for(int i=0;i<=n;i++){
for(int j=1;j<=m;j++){
dp[i][j]=-INF;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
dp[i][j]=max(dp[i-1][j],dp[tout[i]-1][j-1]+d[i]);
}
}
cout << dp[n][m];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |