제출 #1293190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293190		trandaihao5555	Knapsack (NOI18_knapsack)	C++20	37 / 100	1095 ms	576 KiB

knapsack

#include <bits/stdc++.h>

#define int long long

#define debug     cout << "ok\n";
#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 mp make_pair
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>

#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

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

using namespace std;

const int M = 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 _, class __>
    bool minimize(_ &x, const __ y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class _, class __>
    bool maximize(_ &x, const __ y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

template<class _,class __>
    void Add(_ &x, const __ y) {
        x += y;
        if (x >= M) {
            x -= M;
        }
        return;
    }

template<class _,class __>
    void Diff(_ &x, const __ y) {
        x -= y;
        if (x < 0) {
            x += M;
        }
        return;
    }

//--------------------------------------------------------------

const int MaxS = 2007;

int S,n,f[MaxS];
vector<pii> lis[MaxS];

void sol() {
    cin >> S >> n;
    for (int i=1;i<=n;i++) {
        int w,v,k;
        cin >> v >> w >> k;
        if (w <= S) lis[w].pb(mp(v,k));
    }
    for (int i=1;i<=S;i++) {
        sort(lis[i].begin(),lis[i].end());
        int pos = (int)lis[i].size() - 1;
        int cnt = S/i;
        while (pos >= 0 && cnt) {
            for (int j=S;j>=i;j--) {
                maximize(f[j],f[j-i] + lis[i][pos].fi);
            }
            lis[i][pos].se--;
            if (!lis[i][pos].se) pos--;
        }
    }
    cout << f[S];
}

signed main() {
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    FAST
    int t=1;
//    cin >> t;
    while (t--) sol();
}

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