제출 #1061270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1061270		danglayloi1	Knapsack (NOI18_knapsack)	C++17	73 / 100	165 ms	2136 KiB

knapsack

#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = long long;
const ll mod=1e9+7;
const int nx=105;
int n, m, w[nx], v[nx], t[nx];
ll ans=0, dp[nx][2005];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>m>>n;
    for(int i = 1; i <= n; i++)
        cin>>v[i]>>w[i]>>t[i];
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            dp[i][j]=dp[i-1][j];
            for(int k = 1; k <= t[i]; k++)
            {
                if(k*w[i]>j)
                    break;
                dp[i][j]=max(dp[i][j], dp[i-1][j-k*w[i]]+k*v[i]);
            }
        }
    }
    cout<<dp[n][m]; 
}

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