Submission #1351499

#	Time	Username	Problem	Language	Result	Execution time	Memory
1351499		free_de_la_zenith	Knapsack (NOI18_knapsack)	C++20	100 / 100	679 ms	1624 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=1e5+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++) {
        ll rs=1,k=que[i].num;
        while(k) {
            ll cnt=min(rs,k);
            ll w=que[i].w*cnt,val=cnt*que[i].val;
            for(int j=S;j>=w;j--) dp[j]=max(dp[j],dp[j-w]+val);
            k-=cnt;
            rs<<=1;
        }
    }
    cout << dp[S];
}

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: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 27 / 27