제출 #489601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489601		vicyan1611	Knapsack (NOI18_knapsack)	C++14	100 / 100	159 ms	36308 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
const long long oo = 1e18 + 7;

long long s, n;
long long f[2002][2002];
vector <pair <long long, long long>> ite[2002];

int main()
{
    cin >> s >> n;
    for (long long i = 1; i <= n; ++i)
    {
        long long v, w, k;
        cin >> v >> w >> k;
        if (w > s || k <= 0) continue;
        ite[w].push_back(make_pair(v, k));
    }
    for (long long i = 0; i <= s; ++i)
    {
        for (long long j = 0; j <= s; ++j)
        {
            f[i][j] = -oo;
        }
    }
    f[0][0] = 0;
    long long countid = 1;
    for (long long id = 1; id <= s; ++id)
    {
        if (!ite[id].size()) continue;
        sort(ite[id].begin(), ite[id].end(), greater <pair <long long, long long>>());
        for (long long w = 0; w <= s; ++w)
        {
            f[countid][w] = f[countid-1][w];
            long long idt = 0;
            long long copies = 0;
            long long prof = 0;
            long long cnt = 0;
            while ((copies + 1) * id <= w && idt < ite[id].size())
            {
                copies++;
                prof += ite[id][idt].first;
                if (f[countid - 1][w - copies * id] != -oo)
                {
                    f[countid][w] = max(f[countid][w], f[countid - 1][w - copies * id] + prof);
                }
                cnt++;
                if (cnt == ite[id][idt].second)
                {
                    idt++;
                    cnt = 0;
                }
            }
        }
        countid++;
    }
    long long res = 0;
    for (long long i = 0 ; i <= s; ++i)
    {
        for (long long j = 0; j <= s; ++j)
        {
            res = max(res, f[i][j]);
        }
    }
    cout << res;
    return 0;
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:40:50: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             while ((copies + 1) * id <= w && idt < ite[id].size())
      |                                              ~~~~^~~~~~~~~~~~~~~~

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