Submission #1351490

#	Time	Username	Problem	Language	Result	Execution time	Memory
1351490		free_de_la_zenith	Knapsack (NOI18_knapsack)	C++20	37 / 100	1056 ms	444 KiB

knapsack

/**
 *    author:  MINHTPC
 *
**/
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin() , a.end()
#define FOR(i ,a , b) for(int i = a ; i <= b ; ++i)
#define bit(mask,i) ((mask>>i)&1)
#define name "task"
#define lo lower_bound
#define up upper_bound
#define count_bit1(x) __builtin_popcountll(x)
#define count_bit01(x) __builtin_clzll(x)
#define count_bit10(x) __builtin_ctzll(x)

using namespace std;
const int N=2e3+5;
long long dp[N];
struct query {
    int w,val,num;
}que[N];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if(fopen("umnik.inp","r")) {
        freopen("umnik.inp","r",stdin);
    }
    int S,n;
    cin >> S >> n;
    for(int i=1;i<=n;i++) cin >> que[i].val >> que[i].w >> que[i].num;
    for(int i=1;i<=n;i++) {
        for(int j=S;j>=que[i].w;j--) {
            for(int k=1;k<=que[i].num;k++) {
                if(j>=k*que[i].w) dp[j]=max(dp[j],dp[j-k*que[i].w]+que[i].val*k);
            }
        }
    }
    ll ans=0;
    for(int i=0;i<=S;i++) ans=max(ans,dp[i]);
    cout << ans;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen("umnik.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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