제출 #1272782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272782		nthvn	Knapsack (NOI18_knapsack)	C++20	100 / 100	77 ms	65584 KiB

knapsack

#include "bits/stdc++.h"
using namespace std;
#define int long long

#define fi first
#define se second
#define pii pair<int,int> 
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define ll long long
const int S= 2005, N=1e5+5;
int s,n;
vector<pii> a[S];

int dp[S][S];
int g[S][S];

signed main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	if(fopen("TASK.INP", "r")){
		freopen("TASK.INP", "r", stdin);
		freopen("TASK.OUT", "w", stdout);
	}
	cin>>s>>n;
	for(int i=1;i<=n;i++){
		int v,w,k; cin>>v>>w>>k;
		a[w].pb({v,k});
	}
	for(int i=1;i<=s;i++) sort(all(a[i]), greater<pii>());
	for(int i=1;i<=s;i++){
		int pt =-1, sum=0;
		for(int k=1;k<=s;k++){
			g[i][k] = g[i][k-1];
			if(pt<sz(a[i])) {
				if(k<=sum) g[i][k]+= a[i][pt].fi;
				else {
					pt++;
					if(pt<sz(a[i])){
						sum+= a[i][pt].se;
						g[i][k]+= a[i][pt].fi;
					}
					
				}
			}
			// cerr<<g[i][k]<<" \n"[k==s];
		}
	}
	
	for(int i=1;i<=s;i++){
		for(int j=1;j<=s;j++){
			for(int k=0;k*i<=j;k++){
				dp[i][j] = max(dp[i][j], dp[i-1][j-k*i]+g[i][k]);
			}
		}
	}
	
	cout<<*max_element(&dp[s][0], &dp[s][s+1]);
	
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:23:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |                 freopen("TASK.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:24:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |                 freopen("TASK.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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