Submission #1023730

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023730		vjudge1	Knapsack (NOI18_knapsack)	C++17	73 / 100	215 ms	262144 KiB

knapsack

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nemeshay ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define allr(pon) pon.rbegin(), pon.rend()
#define all(pon) pon.begin(), pon.end()
#define nosolve cout << "-1\n"
#define YES cout << "YES\n"
#define Yes cout << "Yes\n"
#define pii pair <int, int>
#define OK cout << "OK\n"
#define Ok cout << "Ok\n"
#define NO cout << "NO\n"
#define No cout << "No\n"
#define pf push_front
#define int long long
#define pb push_back
#define sigma signed
#define sc second
#define fr first
using namespace __gnu_pbds;
using namespace std;
const int N = 1e6 + 20, INF = 1e16 + 7;
int dp[N];
sigma main(){
    nemeshay
    int n, s, mx = 0;
    cin >> s >> n;
    vector <pii> pon;
    for (int i = 0; i < n; i++) {
        int x, y, k;
        cin >> x >> y >> k;
        pon.pb({x, y});
        for (int j = 1; j < min((s + y - 1) / y, k); j++) pon.pb({x, y});
    }
    for (int i = 1; i <= s; i++) dp[i] = INF;
    for (int i = 0; i < pon.size(); i++) {
        for (int j = s; j >= pon[i].sc; j--) {
            if (dp[j - pon[i].sc] != INF) {
                if (dp[j] == INF) dp[j] = pon[i].fr + dp[j - pon[i].sc];
                else dp[j] = max(dp[j], pon[i].fr + dp[j - pon[i].sc]);
                mx = max(mx, dp[j]);
            }
        }
    }
    cout << mx;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:38:23: 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]
   38 |     for (int i = 0; i < pon.size(); i++) {
      |                     ~~^~~~~~~~~~~~

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