제출 #85261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85261		zoooma13	바이오칩 (IZhO12_biochips)	C++14	100 / 100	387 ms	11828 KiB

biochips

#include <bits/stdc++.h>
using namespace std;

#define MAX_N 200005
#define MAX_M 502
#define INF 0x3f3f3f3f

int N ,M;
int A ,B;
int Mem[MAX_N];
vector <int> Adj[MAX_N];

int dp[MAX_M];
vector <int> Solve(int v)
{
    vector <int> ans = {0 ,0};
    for(int i : Adj[v])
    {
        vector <int> ch = Solve(i);
        vector <int> best(min(M+1 ,(int)(ans.size()+ch.size())) ,0);

        for(int j=0; j<ch.size(); j++)
        for(int k=0; k<ans.size() && k<=M-j; k++)
            best[j+k] = max(best[j+k] ,ans[k] + ch[j]);

        ans = best;
    }

    ans[1] = max(ans[1] ,Mem[v]);
    return ans;
}

int main()
{
    scanf("%d%d",&N,&M); assert(N < MAX_N && M < MAX_M);

    int root;
    for(int i=1; i<=N; i++)
    {
        scanf("%d%d",&A,&B);

        Mem[i] = B;
        if(A == 0)
            root = i;
        else
            Adj[A].push_back(i);
    }

    printf("%d\n",Solve(root)[M]);
}

컴파일 시 표준 에러 (stderr) 메시지

biochips.cpp: In function 'std::vector<int> Solve(int)':
biochips.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<ch.size(); j++)
                      ~^~~~~~~~~~
biochips.cpp:23:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int k=0; k<ans.size() && k<=M-j; k++)
                      ~^~~~~~~~~~~
biochips.cpp: In function 'int main()':
biochips.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&M); assert(N < MAX_N && M < MAX_M);
     ~~~~~^~~~~~~~~~~~~~
biochips.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&A,&B);
         ~~~~~^~~~~~~~~~~~~~
biochips.cpp:49:24: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
     printf("%d\n",Solve(root)[M]);
                   ~~~~~^~~~~~

• Subtask 1: 100 / 100