# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502807 | tmn2005 | Biochips (IZhO12_biochips) | C++17 | 285 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>
using namespace std;
typedef long long ll;
#define ar array
#define fr first
#define sc second
#define vec vector
#define ret return
#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define int long long
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N = 1e6+12,INF=1e9+7;
vector <int> g[N];
int tout[N],o=1,n,k,b[N],a[N],dp[200001][501];
void dfs(int v){
int t = o;
for(int to : g[v]){
dfs(to);
}
a[o] = b[v];
tout[o++] = t;
}
main(){
cin>>n>>k;
for (int i=1;i<=n;++i){
int a;
cin>>a>>b[i];
g[a].pb(i);
}
dfs(0);
for(int i=0; i<=n; i++){
for(int j=1; j<=k; j++){
dp[i][j] = -INF;
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=k; j++){
dp[i][j] = max(dp[i-1][j], dp[tout[i]-1][j-1] + a[i]);
}
}
cout<<dp[n][k];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |