| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 85199 | zoooma13 | 바이오칩 (IZhO12_biochips) | C++14 | 2 ms | 440 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;
#define MAX_N 25
#define MAX_M 15
#define INF 0x3f3f3f3f
int N ,M;
int A ,B;
vector <int> Adj[MAX_N];
int Mem[MAX_N];
int dp[MAX_M][MAX_N];
int Solve(int Q ,int M)
{
    if(Adj[Q].empty())
        return (M == 1 ? Mem[Q] : -INF);
    if(~dp[M][Q])
        return dp[M][Q];
    int dp_new[M+1] ,dp_all[M+1] = {0};
    for(int i : Adj[Q])
    {
        memset(dp_new ,-INF ,sizeof dp_new);
        for(int j=1; j<=M; j++)
        for(int h=0; h<=M-j; h++)
            dp_new[j+h] = max(dp_new[j+h] ,dp_all[h]+Solve(i ,j));
        for(int h=0; h<=M; h++)
            dp_all[h] = max(dp_all[h] ,dp_new[h]);
    }
    return dp[M][Q] = (M == 1 ? max(dp_all[M] ,Mem[Q]) : dp_all[M]);
}
int main()
{
    scanf("%d%d",&N,&M);
    int root;
    for(int i=0; i<N; i++)
    {
        scanf("%d%d",&A,&B);
        Mem[i+1] = B;
        if(A == 0)
            root = i+1;
        else
            Adj[A].push_back(i+1);
    }
    memset(dp ,-1 ,sizeof dp);
    cout << Solve(root ,M) << endl;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
