Submission #1107587

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107587		adkjt	Knapsack (NOI18_knapsack)	C++14	37 / 100	1052 ms	504 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second

vector<pair<long long,long long>> V[2222];
long long dp[2222];
pair<long long,pair<long long,long long>> a[111111];//v,w,k
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
    int s,n;
    cin>>s>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i].f>>a[i].s.f>>a[i].s.s;
        if(a[i].s.f>s) continue;
        V[a[i].s.f].push_back({-a[i].f,a[i].s.s});
    }
    for(int i=1; i<=s; i++) dp[i]=-1;
    for(int i=1; i<=s; i++)
        sort(V[i].begin(),V[i].end());
    for(int i=1; i<=s; i++)
    {
        if (V[i].empty()) continue;

            for(auto x:V[i])//v,k
            {
                int idx=0;
                re:
                for (int w = s; w - i >= 0; w--)
                {
                    dp[w] = max(dp[w], dp[w - i] - x.f);

                }
                idx--;
                if(idx>s/i) break;
                x.s--;
                if (x.s == 0)
                {
                    continue;
                }
                else goto re;

            }

    }
long long     ans=0;
    for(int i=1; i<=s; i++)
        ans=max(ans,dp[i]);
    cout<<ans;
}

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