# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236377 | 2020-06-01T16:08:34 Z | MohamedAhmed04 | Biochips (IZhO12_biochips) | C++14 | 9 ms | 5120 KB |
#include <bits/stdc++.h> using namespace std ; const int MAXN = 2e5 + 5 , MAXM = 505 ; int arr[MAXN] , dp[MAXN][MAXM] , tmpdp[MAXM] ; int n , m ; vector< vector<int> >adj(MAXN) ; void dfs(int node) { dp[node][0] = 0 ; for(auto &child : adj[node]) { dfs(child) ; int Max = 0 ; for(int k1 = 0 ; k1 <= m ; ++k1) { if(!dp[node][k1] && k1) break ; for(int k2 = 0 ; k1 + k2 <= m ; ++k2) { if(!dp[child][k2] && k2) break ; Max = max(Max , k1+k2) ; tmpdp[k1+k2] = max(dp[node][k1+k2] , dp[node][k1] + dp[child][k2]) ; } } for(int i = 1 ; i <= Max ; ++i) dp[node][i] = tmpdp[i] ; } dp[node][1] = max(dp[node][1] , arr[node]) ; } int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cin>>n>>m ; int root ; for(int i = 1 ; i <= n ; ++i) { int par ; cin>>par>>arr[i] ; if(par == 0) root = i ; else adj[par].push_back(i) ; } dfs(root) ; return cout<<dp[root][m]<<"\n" , 0 ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 5120 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |