제출 #960259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960259		seriouslyFlawed	Knapsack (NOI18_knapsack)	C++17	100 / 100	59 ms	4956 KiB

knapsack

//#pragma GCC optimize("03,unroll-loops")

#include <bits/stdc++.h>

using namespace std;

// Shortcuts for common operations
#define pb push_back
#define p push
#define ppb pop_back
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define ll long long
//#define int ll
#define endl "\n"
#define sz(x) (int)x.size()

// Type definitions for convenience
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<pii> vii;

// Debugging macros
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debug_vector(v) _debug_vector(#v, v)
template<typename T>
void _debug_vector(const string& name, const vector<T>& a) {
    cerr << name << " = [ ";
    for(const auto &x : a) cerr << x << ' ';
    cerr << "]\n";
}

// I/O redirection for local testing
#define iofile(io) \
        freopen((io + ".in").c_str(), "r", stdin); \
        freopen((io + ".out").c_str(), "w", stdout);

// delta for floodfill
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};

// extended deltas for floodfill
vi edx = {0, 1, 0, -1, 1, 1, -1, -1};
vi edy = {1, 0, -1, 0, 1, -1, 1, -1};

// Common outputs
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }

void fx() {
    int s, n;
    cin >> s >> n;

    vector<array<int, 3>>orders(n); // (value, weight, copies)
    for(int i =  0; i < n; i++) cin >> orders[i][0] >> orders[i][1] >> orders[i][2];
    
    sort(all(orders));
    reverse(all(orders));

    unordered_map<int, vii>stuff;

    for(int i = 0; i < n; i++) stuff[orders[i][1]].pb({orders[i][0], orders[i][2]});

    vll dp(s+1, 0);


    for(const auto &[weight, list]: stuff){

        int tillSum = 0;

        for(const auto &[value, copies] : list){
            
            for(int copy = 1; copy <= copies; copy++){
                tillSum += weight;

                if(tillSum > s) break;

                for(int i = s - weight; i >= 0; i--) dp[i+weight] = max(dp[i+weight], dp[i] + value);
            }
        }
    }

    cout << *max_element(all(dp)) << endl;
}

signed main() {

    cin.tie(0)->sync_with_stdio(0);
    // Uncomment the following lines for file I/O
    // iofile(string("hello"));
    
    // Uncomment the following lines for multiple test cases
    // int t; cin >> t; while(t--) fx();
    
    // Single test case
    fx();
    
    return 0;
}

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