Submission #438599

#	Time	Username	Problem	Language	Result	Execution time	Memory
438599		Haidara	Knapsack (NOI18_knapsack)	C++17	73 / 100	1102 ms	41344 KiB

knapsack

        #include<bits/stdc++.h>
        #define rep(i,x,n) for(int i=x;i<n;i++)
        #define FOR(i,n) rep(i,0,n)
        using namespace std;
        const int maxn=100002;
        int s,n,v[maxn],w[maxn],k[maxn],dp[maxn][2002];
        int solve(int inx=0,int curr=0)
        {
            if(dp[inx][curr])
                return dp[inx][curr];
            if(inx==n)
                return 0;
            FOR(i,k[inx]+1)
            {
                if(curr+i*w[inx]<=s)
                    dp[inx][curr]=max(dp[inx][curr],solve(inx+1,curr+i*w[inx])+i*v[inx]);
              	else break;
            }
            return dp[inx][curr];
        }
        signed main()
        {
            cin>>s>>n;
            FOR(i,n)
            {
                cin>>v[i]>>w[i]>>k[i];
                k[i]=min(k[i],s/w[i]);
            }
            cout<<solve();
        }

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