제출 #520316

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
520316		nguyentu	Knapsack (NOI18_knapsack)	C++14	12 / 100	454 ms	2856 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define int long long

struct seg {
    int v , w , k;
};

signed main() {
    ios::sync_with_stdio(0); cin.tie(NULL);
    cout.tie(NULL);
    int s , n; cin >> s >> n;
    vector<seg> a(n + 1);
    for (int i = 1 ; i <= n ; i++) {
        cin >> a[i].v >> a[i].w >> a[i].k;
    }
    vector<vector<int>> f;
    vector<int> g;
    f.assign(n + 1 , vector<int> (s + 1 , 0));
    for (int i = 1 ; i <= n ; i++) {
        g.assign(s + 1 , 0);
        for (int j = 0 ; j <= s ; j++) {
            if (a[i].w <= j) {
                int x = f[i][j - a[i].w] + a[i].v;
                int y = f[i - 1][j - a[i].w] + a[i].v;
                int z = f[i - 1][j];    
                if (x == y && y == z) {
                    f[i][j] = f[i - 1][j];
                    continue;
                }
                if (y >= z && y >= x) {
                    f[i][j] = f[i - 1][j - a[i].w] + a[i].v;
                    g[j] = 1;
                }
                if (x > z && x > y && (g[j - a[i].w] + 1) <= a[i].k) {
                    f[i][j] = f[i][j - a[i].w] + a[i].v;
                    g[j] = g[j - a[i].w] + 1;
                }
                if (z >= y && z >= x) f[i][j] = f[i - 1][j];
            }
            else f[i][j] = f[i - 1][j];
        }
    }
    for (int i = 1 ; i <= n ; i++) {
        for (int j = 0 ; j <= s ; j++) {
            cerr << f[i][j] << " ";
        }
        cerr << '\n';
    }
    int ans = 0;
    for (int i = 1 ; i <= s ; i++) {
        ans = max(ans , f[n][i]);
    }
    cout << ans;
    return 0;
}

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