제출 #1101066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1101066		votranngocvy	Knapsack (NOI18_knapsack)	C++14	100 / 100	42 ms	35144 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
const int N = 2e3 + 5;
vector<pii>vec[N];
ll dp[N][N];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int s,n;
    cin >> s >> n;
    for (int i = 1; i <= n; i++) {
        int v,w,k;
        cin >> v >> w >> k;
        vec[w].push_back({v,k});
    }
    for (int i = 1; i <= 2000; i++) 
        sort(vec[i].begin(),vec[i].end(),greater<pii>());
    ll ans = 0;
    for (int i = 1; i <= 2000; i++) 
        for (int j = 1; j <= s; j++) {
            dp[i][j] = dp[i - 1][j];
            ll sumW = 0,sumV = 0;
            for (auto x: vec[i]) {
                int num = x.se,v = x.fi;
                for (int z = 1; z <= num; z++) {
                    sumV += v,sumW += i;
                    if (sumW > j) break;
                    dp[i][j] = max(dp[i][j],dp[i - 1][j - sumW] + sumV);
                }
                if (sumW > j) break;
            }
            ans = max(ans,dp[i][j]);
        }
    cout << ans << "\n";
}

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