제출 #484658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484658		Qkake	Knapsack (NOI18_knapsack)	C++17	0 / 100	1 ms	204 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

typedef pair<int, int> pi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pli> vli;
typedef vector<pil> vil;

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int oo = 1000000007;
const int MX = 100001;
const ld PI = 4 * atan((ld)1);

int n, s;
vi v, w, t;

void solve() {
	cin >> s >> n;
	v.resize(n + 1); w.resize(n + 1); t.resize(n + 1);
	for (int i = 1; i <= n; i++) cin >> v[i] >> w[i] >> t[i];
	vector<vi> dp(n + 1, vi(s + 1, 0));
	dp[0][0] = 1;
	for (int i = 0; i < n; i++) for (int j = 0; j <= s; j++) {
		dp[i + 1][j] = dp[i][j];
		if (j - w[i + 1] >= 0) dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i + 1]] + v[i + 1]); 
	}
	cout << dp[n][s];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	solve();
	return 0;
}

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