Submission #1088453

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088453		T0p_	Knapsack (NOI18_knapsack)	C++14	73 / 100	1066 ms	1448 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
 
long long dp[2][2005];
 
int main()
{
    int s, n;
    scanf(" %d %d",&s,&n);
    for(int i=1 ; i<=n ; i++)
    {
        int w, k;
        long long v;
        scanf(" %lld %d %d",&v,&w,&k);
        for(int j=1 ; j<=s ; j++)
        {
            dp[i%2][j] = max(dp[i%2][j-1], dp[(i-1)%2][j]);
            for(long long t=1 ; t<=min(k, s/w) && j-w*t>=0 ; t++) dp[i%2][j] = max(dp[i%2][j], dp[(i-1)%2][j-w*t] + v*t);
        }
    }
    printf("%lld\n",dp[n%2][s]);
    return 0;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf(" %d %d",&s,&n);
      |     ~~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         scanf(" %lld %d %d",&v,&w,&k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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