제출 #696851

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

knapsack

#include <bits/stdc++.h>
#define ll long long
#define ii pair <int, int>
#define ill pair <ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define file "test"
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int base = 311;
const int BLOCK_SIZE = 2000;
 
int n, m, v[N], w[N], k[N];
ll f[N][2005];

vector <int> decompose(int t) {
    vector <int> a;
    int x = 1;
    while (x < t) {
        a.push_back(x);
        t -= x;
        x *= 2;
    }
    a.push_back(t);
    return a;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen(file".inp","r",stdin); freopen(file".out","w",stdout);
    // #endif
 
    cin >> m >> n;
    for (int i = 1; i <= n; i ++) {
        cin >> v[i] >> w[i] >> k[i];
        vector <int> b = decompose(k[i]);
        for (auto k: b) 
            for (int j = m; j >= k * w[i]; j --)
                f[i][j] = max(f[i][j], max(f[i][j - k * w[i]], f[i - 1][j - k * w[i]]) + k * v[i]);

        for (int j = 1; j <= m; j ++)
            f[i][j] = max(f[i][j], f[i - 1][j]);
    }

    cout << f[n][m];
} 

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