제출 #725193

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725193		Mohamed_Kachef06	Knapsack (NOI18_knapsack)	C++17	0 / 100	105 ms	262144 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define MODY ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long 
#define pii pair<int , int>
#define A first
#define B second
#define pb push_back

int n , s;
vector<vector<pii>> vec(2001);
vector<pii> a;
int dp[22000][2001];
int knapsack(int i , int w){
    if (i==0) return 0 ;
    if (~dp[i][w]) return dp[i][w];
    int x = 0 , y = 0;
    if (w>=a[i].A) x = knapsack(i-1 , w-a[i].A) + a[i].B;
    y = knapsack(i-1 , w);
    return dp[i][w] = max(x, y);
}
signed main(){
    memset(dp , -1 , sizeof dp);
    cin >> s >> n;
    for (int i = 1 ; i<=n ; i++){
        int v , w , k;
        cin >> v >> w >> k;
        vec[w].pb({v , k});
    }
    for (int i = 1 ; i<=s ; i++) sort(vec[i].begin() , vec[i].end() , greater<pii>());
    a.pb({0 , 0});
    for (int i = 1 ; i<=s ; i++){
        int copies = 0;
        for (auto j : vec[i]){
            while(copies < s/i && j.B) { a.pb({i , j.A}); j.B--; copies++; }
        }
    }
    cout << knapsack(a.size()-1 , s);
}

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