Submission #852863

#	Time	Username	Problem	Language	Result	Execution time	Memory
852863		DP_196	Knapsack (NOI18_knapsack)	C++14	100 / 100	48 ms	28840 KiB

knapsack

#include <bits/stdc++.h>
 
using namespace std;
 
#define file "MARKET"
 
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
 
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll
 
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
 
const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
 
template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}
 
int n, W;
vector<pair<int, int> > adj[N];
int f[N];
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
 
  
 
    cin >> W >> n;
    for (int i = 1; i <= n; ++i) {
    	int c, e, l;
    	cin >> e >> c >> l;
    	adj[c].emplace_back(e, l);
    }
 
    for (int i = 1; i <= W; ++i) {
    	sort(all(adj[i]));
    	reverse(all(adj[i]));
    	int curW = i;
    	for (auto it : adj[i]) {
    		int e = it.fi, l = it.se;
    		if (curW > W) break;
    		for (int j = 0; j < l && curW <= W; ++j, curW += i) {
    			for (int k = W; k >= i; --k) {
    				f[k] = max(f[k], f[k - i] + e);
    			}
    		}
    	}
    }
 
    cout << f[W];
 
    return 0;
}

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