제출 #1241036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241036		thelegendary08	Knapsack (NOI18_knapsack)	C++17	100 / 100	59 ms	2888 KiB

knapsack

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(s,n);
	vector<vpii>wt(s+1);
	f0r(i,n){
		in3(v,w,k);
		wt[w].pb(mp(v, k));
	}
	f0r(i, s+1){
		sort(rall(wt[i]));
	}
	vvi best(s+1);
	FOR(i, 1, s+1){
		f0r(j, wt[i].size()){
			int V = wt[i][j].first; int K = wt[i][j].second;
			f0r(k, K){
				if(best[i].size() * i > s)break;
				best[i].pb(V);
			}
		}
	}
	
	vi dp(s+1);
	vi dp2(s+1);
	FOR(i, 1, s+1){
		f0r(k, best[i].size()){
			f0r(j, s+1){
				if(j - i >= 0){
					dp2[j] = max(dp[j], dp[j-i] + best[i][k]);
				}
			}
			f0r(j, s+1){
				dp[j] = dp2[j];
				
			}
		}
	}
	out(dp[s]);
}

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