Submission #1180111

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180111		Nonoze	Knapsack (NOI18_knapsack)	C++20	100 / 100	51 ms	8516 KiB

knapsack

/*
*	Author: Nonoze
*	Created: Sunday 06/04/2025
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<vector<int>> a;


void solve() {
	read(k, n);
	a.clear(), a.resize(n, vector<int>(3)); read(a);
	vector<vector<pair<int, int>>> vec(k+1);
	for (int i=0; i<n; i++) {
		vec[a[i][1]].pb({a[i][0], a[i][2]});
	}
	a.clear();
	vector<pair<int, int>> b;
	for (int i=1; i<=k; i++) {
		int sum=k;
		sort(rall(vec[i]));
		for (auto& [x, y] : vec[i]) {
			while (sum>0 && y) {
				b.pb({i, x});
				sum-=i;
				y--;
			}
		}
	}
	vector<int> dp(k+1, 0);
	int ans=0;
	for (auto &[x, y] : b) {
		for (int i=k; i>=x; i--) {
			cmax(dp[i], dp[i-x]+y);
			cmax(ans, dp[i]);
		}
	}
	cout << ans << endl;
}

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