제출 #438611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
438611		Haidara	Knapsack (NOI18_knapsack)	C++17	49 / 100	1020 ms	1048 KiB

knapsack

    #include<bits/stdc++.h>
    #define rep(i,x,n) for(int i=x;i<n;i++)
    #define FOR(i,n) rep(i,0,n)
    using namespace std;
    int s,n,v[100001],w[100001],k[100001],dp[100001][2001];
    int solve(int inx=0,int curr=0)
    {
        if(dp[inx][curr])
            return dp[inx][curr];
        if(inx==n)
            return 0;
        FOR(i,k[inx]+1)
        {
            if(curr+i*w[inx]<=s)
                dp[inx][curr]=max(dp[inx][curr],solve(inx+1,curr+i*w[inx])+i*v[inx]);
            else
                break;
        }
        return dp[inx][curr];
    }
    signed main()
    {
      scanf("%d",&s);
      scanf("%d",&n);
        FOR(i,n)
        {
          scanf("%d",(v+i));
          scanf("%d",(w+i));
          scanf("%d",(k+i));
            k[i]=min(k[i],s/w[i]);
        }
        cout<<solve();
    }

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:23:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |       scanf("%d",&s);
      |       ~~~~~^~~~~~~~~
knapsack.cpp:24:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |       scanf("%d",&n);
      |       ~~~~~^~~~~~~~~
knapsack.cpp:27:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |           scanf("%d",(v+i));
      |           ~~~~~^~~~~~~~~~~~
knapsack.cpp:28:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |           scanf("%d",(w+i));
      |           ~~~~~^~~~~~~~~~~~
knapsack.cpp:29:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |           scanf("%d",(k+i));
      |           ~~~~~^~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27