제출 #873154

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873154		Foolestboy	Knapsack (NOI18_knapsack)	C++14	100 / 100	75 ms	3700 KiB

knapsack

#include <bits/stdc++.h>

#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back
#define all(x)    x.begin(), x.end()
#define rall(x)   x.rbegin(), x.rend()
#define sz(s)     (int)s.size()
#define prev      __prev
#define next      __next
#define left      __left
#define right     __right

#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class BUI, class TRONG>
    bool minimize(BUI &x, const TRONG y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class BUI, class TRONG>
    bool maximize(BUI &x, const TRONG y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/
/* Template is copied by Trong */

                           /** Losing in Provincial Contests **/
                                    /** TRYING HARDER**/
                                   /**      ORZ     **/

/* -----------------[ MAIN CODE GOES HERE ]----------------- */

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2020;

int n, S;
int f[N];
vector<pii> vec[N];

void solve(){
    cin >> S >> n;
    for(int i = 1; i <= n; i++){
        int V, W, K; cin >> V >> W >> K;
        vec[W].push_back(mp(V, K));
    }
    for(int i = 1; i <= S; i++){
        if(vec[i].empty()) continue;
        sort(all(vec[i]), greater<>());
        for(int x = S; x >= 0; x--){
            int W = 0, V = 0;
            for(int j = 0; j < sz(vec[i]) && W <= S; j++){
                for(int k = 1; k <= vec[i][j].se && W <= S; k++){
                    W += i;
                    V += vec[i][j].fi;
                    if(x >= W)  maximize(f[x], f[x - W] + V);
                }
            }
        }
    }
    cout << f[S] << '\n';
}
/*
15 5
4 12 1
2 1 1
10 4 1
1 1 1
2 2 1
*/

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;

    while( tt-- ){
        solve();
    }

    return 0;
}

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