제출 #442658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442658		pawanagrawal	Knapsack (NOI18_knapsack)	C++14	100 / 100	144 ms	3860 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
typedef long long ll;
typedef long double ld;
#define all(a) a.begin(),a.end()
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define F first
#define S second
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define nl "\n"
const int MOD = 1e9+7;
const ld PI = 3.1415926535898;
const ll INF = LLONG_MAX;
const int N = 500;

int main()
{
	ios;
	int s,n,val,qua,wei;
	cin>>s>>n;
	vector<pair<int,int>>prods[s+1];
	for(int i=1;i<=n;i++)
	{
		cin>>val>>wei>>qua;
		prods[wei].pb({val,qua});
	}
	vector<pair<int,int>>v;
	for(int i=1;i<=s;i++)
	{
		if(prods[i].size()==0)continue;
		sort(all(prods[i]));
		int maq=s/i;
		for(int j=prods[i].size()-1;j>=0;j--)
		{
			int temp=min(maq,prods[i][j].S);
			maq-=temp;
			while(temp--)
			{
				v.pb({i,prods[i][j].F});
			}
			if(!maq)break;
		}
	}
	int res[s+1]={0};
	for(int i=0;i<v.size();i++)
	{
		for(int j=s-1;j>=0;j--)
		{
			if(v[i].F+j<=s)res[v[i].F+j]=max(res[v[i].F+j],res[j]+v[i].S);
		}
	}
	cout<<res[s]<<nl;
}

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

knapsack.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("unroll-loops")
      | 
knapsack.cpp: In function 'int main()':
knapsack.cpp:52:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~

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