제출 #1143739

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

knapsack

#include<bits/stdc++.h>
#include<random>
using namespace std;
using db=double;
using ll=long long;
using sll=__int128;//super long long
using lb=long double;//lb is slow
//numbers for hashing: b(19260817),mod(998244353)
// freopen("fencedin.in", "r", stdin);
// freopen("fencedin.out", "w", stdout);

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int s,n; cin>>s>>n; vector<priority_queue<pair<int,int>>>a(s+1);
	for(int i=1; i<=n; i++){
		int q,w,e; cin>>q>>w>>e; a[w].push({q,e});
	}
	vector<int>dp(s+1,0);
	for(int i=1; i<=s; i++){
		int sum=0;
		while(a[i].size() && sum+i<=s){
			int val=a[i].top().first, len=a[i].top().second; a[i].pop();
			if(len-1>0)a[i].push({val,len-1});
			for(int j=s; j>=i; j--){
				dp[j]=max(dp[j],dp[j-i]+val);
			}
		}
	}
	int ans=0;
	for(int i=0; i<=s; i++){
		ans=max(ans,dp[i]);
	}
	cout<<ans<<'\n';
}

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