제출 #708166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708166		01001000ung	Knapsack (NOI18_knapsack)	C++14	100 / 100	153 ms	35684 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
struct chiso{
    int val, weight, quantity;
};

chiso a[100005];
vector <int> D[2005];

long long dp[2005][2005];

bool cmp(int x, int y){
    return a[x].val > a[y].val;
}

int main(){
    //freopen("a.inp", "r", stdin); freopen("a.out", "w", stdout);
    int s, n; cin >> s >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i].val >> a[i].weight >> a[i].quantity;
        D[a[i].weight].push_back(i);
    }
    for (int i = 1; i <= s; i++){
        if (!D[i].empty()) sort(D[i].begin(), D[i].end(), cmp);
    }
    for (int i = 1; i <= s; i++)
    {
        for (int j = 1; j <= s; j++)
        {
            if (!D[i].empty())
            {
                dp[i][j] = dp[i - 1][j];
                int k = 1, dem = 1, ii = 0;
                long long sum = 0;
                while (j - k * i >= 0 && ii < D[i].size())
                {
                    sum += a[D[i][ii]].val;
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - k * i] + sum);
                    dem++; k++;
                    if (dem > a[D[i][ii]].quantity) dem = 1, ii++;
                    //cout << i << " " << j << " " << ii << " " << dp[i][j] << endl;
                }
            }
            else dp[i][j] = dp[i - 1][j];
            //cout << i << " " << j << " " << dp[i][j] << endl;
        }
    }
    cout << dp[s][s];
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:35:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |                 while (j - k * i >= 0 && ii < D[i].size())
      |                                          ~~~^~~~~~~~~~~~~

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