제출 #696911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696911		khanhtai	Knapsack (NOI18_knapsack)	C++14	12 / 100	2 ms	340 KiB

knapsack

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define endl '\n'
#define pi 3.14159265359
#define TASKNAME "knapsack"
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 1e5 + 9;
int dp[2][MAXN],s[MAXN],w[MAXN],k[MAXN];
int n,S;
main()
{
    fast;
 //   freopen(TASKNAME".inp","r",stdin);
 //   freopen(TASKNAME".out","w",stdout);
    cin>>S>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i]>>w[i]>>k[i];
    }
    for(int i=1;i<=n;i++){
        int ii = i&1;
        for(int j=1;j<=S;j++){
            for(int t=1;t<=min(j/w[i],k[i]);t++){
                dp[ii][j] = max(dp[ii][j],dp[!ii][j]);
                if (j>= t*w[i]){
                    dp[ii][j] = max(dp[!ii][j-t*w[i]] + t*s[i], dp[ii][j]);
                }
            }
        }
    }
    cout<<dp[n&1][S]<<endl;
}

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

knapsack.cpp:22:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main()
      | ^~~~

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