Submission #1183039

#	Time	Username	Problem	Language	Result	Execution time	Memory
1183039		chikien2009	Knapsack (NOI18_knapsack)	C++20	12 / 100	0 ms	328 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, s;
array<int, 3> p[100000];
long long f[2001];

inline bool comp(const array<int, 3> & ina, const array<int, 3> & inb)
{
    return ina[0] * inb[1] > inb[0] * ina[1];
}

int main()
{
    setup();

    cin >> s >> n;
    fill_n(f, s + 1, -1);
    f[0] = 0;
    for (int i = 0; i < n; ++i)
    {
        cin >> p[i][0] >> p[i][1] >> p[i][2];
    }
    sort(p, p + n, comp);
    for (int i = 0; i < n; ++i)
    {
        for (int j = s; j >= 0; --j)
        {
            if (f[j] != -1)
            {
                for (int k = 1; k <= p[i][2] && k * p[i][1] <= s; ++k)
                {
                    if (f[j + k * p[i][1]] != -1)
                    {
                        break;
                    }
                    f[j + k * p[i][1]] = f[j] + k * p[i][0];
                }
            }    
        }
    }
    cout << (*max_element(f, f + s + 1));
    return 0;
}

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