제출 #633553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633553		ojoConmigo	Knapsack (NOI18_knapsack)	C++17	49 / 100	113 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;
    Item a;
    a.v = a.k = a.w = 0;
    v.push_back(a);
    int cont = 0;
    for(int i=1; i<=n; i++){
        Item h;
        cin >> h.v >> h.w >> h.k;
        int ind = 0;
        while(h.k-- && ind < 2000){
            cont++; ind++;
            v.push_back(h);
        }
    }
    //sort(begin(v),end(v));
    //reverse(begin(v),end(v));
    vector<vector<ll>> dp(cont+1,vector<ll> (s+1,0));
    for(int i=1; i<=cont; i++){
        for(int j=1; j<=s; j++){
            dp[i][j] = dp[i-1][j];
            if(j-v[i].w >= 0){
                dp[i][j] = max(dp[i][j],dp[i-1][j-v[i].w] + v[i].v);
            }
        }
    }
    cout << dp[cont][s] << endl;
}

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