제출 #540566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540566		ac2hu	Knapsack (NOI18_knapsack)	C++14	37 / 100	7 ms	1876 KiB

knapsack

#include <bits/stdc++.h>
#ifdef DEBUG
#include "../templates/debug.h"
#else 
#define deb(x...)
#endif
using namespace std;
#define int unsigned long long
int dp[(int)1e5 + 100][(int)2e3 + 10];
signed main() {
	iostream::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
        int s,n;cin >> s >> n;
        int ll = ceil(log2(s));
        vector<array<int,3>> items(n);
        for(int i = 0;i<n;i++){
                for(int j = 0;j<3;j++)cin >> items[i][j];
        }
        for(int i =0;i<n;i++){
                for(int j = 0;j<=s;j++)
                        dp[i + 1][j] = dp[i][j];
                items[i][2] = min(items[i][2], ((int)1 << ll));;
                while(items[i][2] > 0){
                        int lg = log2(items[i][2]);
                        items[i][2] -= (1ll << lg);
                        for(int mask = 0;mask<=lg;mask++){
                               for(int j=  1;j<=s;j++){
                                       dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - 1]);
                                        int weight = items[i][1]*((int)1 << mask);
                                        int price = items[i][0]*((int)1 << mask);
                                        if(j >= weight)
                                                dp[i + 1][j] = max(dp[i + 1][j], dp[i][j -  weight] + price);
                               }
                        }
                        for(int j = 1;j<=s;j++)
                                dp[i][j] = dp[i + 1][j];

                }
        }
        cout << dp[n][s] << "\n";
}

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