제출 #932206

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932206		Regulus	Knapsack (NOI18_knapsack)	C++17	73 / 100	1091 ms	1584 KiB

knapsack

#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST
const int N = 1e5+5;
ll wei, val, num, dp[2005];

int main(void)
{ IO
    int n, i, T;

    cin >> T >> n;
    for (i=1; i <= n; ++i)
    {
        cin >> val >> wei >> num;
        for (int j=1; num > 0; j <<= 1)
        {
            int tmp = min((ll)j, num);
            num -= tmp;
            for (int k=T; k >= tmp*wei; --k)
                dp[k] = max(dp[k], dp[k-wei*tmp] + val*tmp);
        }
    }

    cout << dp[T] << '\n';

    return 0;
}

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