Submission #1313149

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313149		rayxu	Knapsack (NOI18_knapsack)	C++20	12 / 100	1 ms	332 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen("knapsack.in","r",stdin);
    int s,n; cin>>s>>n;
    vector<pair<int,int>> stuff;
    vector<vector<pair<int,int>>> gw(s+1);
    for (int i=0;i<n;i++) {
        int a,b,c; cin>>a>>b>>c;
        gw[b].push_back({a,c});
    }
    for (int i=1;i<=s;i++) sort(gw[i].begin(),gw[i].end());
    for (int i=1;i<=s;i++) {
        int canchoose=(s/i),pt=0,l=gw[i].size();
        while (canchoose>0 && pt<l) {
            int sb=min(canchoose,gw[i][pt].second);
            canchoose-=sb;
            for (int j=0;j<sb;j++) stuff.push_back({gw[i][pt].first,i});
            pt++;
        }
    }
    vector<int> dp(s+1,0);
    for (auto i:stuff) {
        for (int j=s;j>=i.second;j--) dp[j] = max(dp[j],dp[j-i.second]+i.first);
    }
    cout<<dp[s];
    return 0;
}

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