제출 #633599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633599		ojoConmigo	Knapsack (NOI18_knapsack)	C++17	73 / 100	211 ms	262144 KiB

knapsack

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

typedef long long ll;
typedef long double ld;

struct Item{
    ll v,w,k;

    bool operator<(const Item &rhs){
        return ((ld)((ld)v/(ld)w) < (ld)((ld)rhs.v/(ld)rhs.w));
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int s,n;
    cin >> s >> n;
    vector<Item> v(n+1);
    for(int i=1; i<=n; i++){
        cin >> v[i].v >> v[i].w >> v[i].k;
    }
    //sort(begin(v),end(v));
    //reverse(begin(v),end(v));
    vector<vector<ll>> dp(n+1,vector<ll> (s+1,0));
    for(int i=1; i<=n; i++){
        for(int j=1; j<=s; j++){
            dp[i][j] = max(dp[i][j],dp[i-1][j]);
            ll t = 1;
            while(t <= v[i].k){
                if(j - t*v[i].w < 0)break;
                dp[i][j] = max(dp[i][j],dp[i-1][j-t*v[i].w] + t*v[i].v);
                t++;
            }
        }
    }
    cout << dp[n][s] << endl;
}

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