제출 #1270116

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1270116		limits	Knapsack (NOI18_knapsack)	C++20	0 / 100	0 ms	328 KiB

knapsack

#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue

template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;

const int N = 100'000;
const int S = 20;

ll dp[S];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int s, n, v, w, k;
	cin >> s >> n;
	
	fnr(i, 1, n+1) {
		cin >> v >> w >> k;
		for (int ss = s; ss >= w; --ss) {
			for (int j = 1; j <= min(ss/w, k); ++j) {
				dp[ss] = max(dp[ss], (ll)j * v + dp[ss - j * w]);
			}
		}
	}
	ctn(dp[s]);
}

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