# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256294 | uacoder123 | Biochips (IZhO12_biochips) | C++14 | 72 ms | 20984 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>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int arr[20001][501]={};
int n,m;
vi al[20001];
int val[20001];
void dfs(int node,int p)
{
for(int i=0;i<al[node].size();++i)
if(al[node][i]!=p)
dfs(al[node][i],node);
arr[node][0]=0;
for(int i=0;i<al[node].size();++i)
{
if(al[node][i]!=p)
{
for(int j=m;j>=0;--j)
{
for(int k=0;k<=j;++k)
{
if((arr[node][j-k]!=0||j-k==0)&&(arr[al[node][i]][k]!=0||k==0))
arr[node][j]=max(arr[node][j],arr[node][j-k]+arr[al[node][i]][k]);
}
}
}
}
arr[node][1]=max(val[node],arr[node][1]);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
int r;
for(int i=1;i<=n;++i)
{
int f,w;
cin>>f>>w;
if(f!=0)
{
al[f].pb(i);
al[i].pb(f);
}
else
r=i;
val[i]=w;
}
dfs(r,r);
cout<<arr[r][m]<<endl;
return(0);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |