제출 #985763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985763		lftroq	Knapsack (NOI18_knapsack)	C++14	73 / 100	1088 ms	17600 KiB

knapsack

#include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'

using namespace std;

void solve()
{
    int s,n;
    cin >> s >> n;
    long long dp[s+1]={0};
    vector<long long> v,w;
    for(int i=1;i<=n;i++)
    {
        int a,b,c;
        cin >> a >> b >> c;
        int p=1;
        while(c>=p)
        {
            c-=p;
            v.push_back(1ll*a*p);
            w.push_back(1ll*b*p);
            p<<=1;
        }
        if(c)
        {
            v.push_back(1ll*a*c);
            w.push_back(1ll*b*c);
        }
    }
    for(int i=0;i<(int)w.size();i++) for(int j=s;j>=w[i];j--) dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
    cout << dp[s] << endl;
}

int main()
{
    fastIO
    solve();
    return 0;
}

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