제출 #780592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780592		vjudge1	Dostavljač (COCI18_dostavljac)	C++17	140 / 140	144 ms	2288 KiB

dostavljac

#include <bits/stdc++.h>

using namespace std;

vector < int > g[505];
int dp[505][505][2];
int cst[505];

void solve(int p,int u) {

    for (int i=0;i<g[u].size();i++) {
        int to=g[u][i];
        if (to == p) continue;
        solve(u,to);
        for (int now=500;now>=0;now--)
            for (int x=1;x+2+now<=503;x++) {
                dp[u][now+2+x][1]=max(dp[u][now+2+x][1],dp[u][now][1]+dp[to][x][1]);
                dp[u][now+2+x][0]=max(dp[u][now+2+x][0],dp[u][now][0]+dp[to][x][1]);
                dp[u][now+1+x][0]=max(dp[u][now+1+x][0],dp[u][now][1]+dp[to][x][0]);
                dp[u][now+1+x][0]=max(dp[u][now+1+x][0],dp[u][now][1]+dp[to][x][1]);
            }
    }

    for (int now=500;now>=1;now--)
        dp[u][now][0]=max(dp[u][now][0],dp[u][now-1][0]+cst[u]),
        dp[u][now][1]=max(dp[u][now][1],dp[u][now-1][1]+cst[u]);

}

int n,m,i,a,b,res;

int main() {
    cin>>n>>m;
    for (i=1;i<=n;i++)
        cin>>cst[i];
    for (i=1;i<n;i++) {
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
        g[b].push_back(a);
    }
    solve(0,1);
    res=0;
    for (i=0;i<=m;i++)
        res=max(res,max(dp[1][i][0],dp[1][i][1]));
    cout<<res<<endl;
}

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

dostavljac.cpp: In function 'void solve(int, int)':
dostavljac.cpp:11:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (int i=0;i<g[u].size();i++) {
      |                  ~^~~~~~~~~~~~
dostavljac.cpp: In function 'int main()':
dostavljac.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d%d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14