제출 #794324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794324		theghostking	Knapsack (NOI18_knapsack)	C++14	49 / 100	40 ms	32000 KiB

knapsack

    #include <bits/stdc++.h>
    using namespace std;
     
    #define int long long
     
    int dp[2005][2005];
     
    int search(int i, int remW, vector<pair<int,int>>& kp, int total){
        if (i == total) return 0;
        if (remW == 0) return 0;
        if (dp[i][remW] != -1) return dp[i][remW];
        if (kp[i].first <= remW){
            return dp[i][remW] = max(search(i+1,remW,kp,total),search(i+1,remW-kp[i].first,kp,total)+kp[i].second);
        }
        else{
            return dp[i][remW] = search(i+1,remW,kp,total);
        }
    }
     
    signed main() {
        memset(dp,-1,sizeof(dp));
        int s,n;
        cin >> s >> n;
        vector<int> arr[2000];//offset weight by one for now
        for (int i = 0; i<n; i++){
            int v,w,k;
            cin >> v >> w >> k;
            k = min(2000LL,k);
            w--;
            int sz1 = arr[w].size();
            int left = min(2000-sz1,k);
            for (int j = 0; j<left; j++){
                arr[w].push_back(v);
            }
        }
        int total = 0;
        vector<pair<int,int>> kp;
        for (int i = 0; i<2000; i++){
            int sz = arr[i].size();
            total += sz;
            for (int j = 0; j<sz; j++){
                kp.push_back({i+1,arr[i][j]}); //weight,value
            }
        }
        cout << search(0,s,kp,total) << '\n';
        return 0;
    }

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