제출 #1014749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014749		Macker	Knapsack (NOI18_knapsack)	C++17	29 / 100	2 ms	440 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
typedef long double ld;
typedef long long ll;
#define int ll
typedef pair<int, int> pii;

#define all(v) v.begin(), v.end()
#define FOR(i, n) for (int i = 0; i < n; i++)
#define inf LLONG_MAX/2
#define ff first
#define ss second
#define ckmin(a, b) a = min(a, b)
#define ckmax(a, b) a = max(a, b)

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

signed main()
{
    int x, n; cin >> x >> n;
    vector<vector<pii>> m(x + 1);
    FOR(i, n){
        int v, w, k; cin >> v >> w >> k;
        m[w].push_back({k, v});
    }
    FOR(i, x + 1) sort(all(m[i]));

    vector<int> dp(x + 1);
    for (int i = 1; i <= x; i++) {
        int sv = 0;
        int sw = 0;
        FOR(cnt, x / i + 1){
            if(m[i].size() == 0) break;
            sw = i;
            sv = m[i].back().ss;
            m[i].back().ff--;
            if(m[i].back().ff == 0) m[i].pop_back();

            for (int j = x; j >= 0; j--) {
                if(j + sw > x) continue;
                ckmax(dp[j + sw], dp[j] + sv);
            }
        }
    }
    cout << dp[x] << endl;
}

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