제출 #1107192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1107192		Daniel_1997	Knapsack (NOI18_knapsack)	C++17	73 / 100	1056 ms	3920 KiB

knapsack

#include<bits/stdc++.h>
#pragma GCC optimizate("Ofast")
using namespace std;
 
///Error types :
#define rte std::vector<int>rtt(oo);
#define wa std::cout<<"d";
#define tle while(1){;}
#define ir exit(1);
 
 
///STL
#define pb push_back
#define pp pop
#define fr first
#define sc second
#define vec vector<int>
 
 
///General
#define ios ios_base::sync_with_stdio(0); cin.tie(0),cout.tie(0)
#define int long long
#define endl "\n"
#define oo 1e18
const int mod = 998244353;

int32_t main(){

    int k,n;
    cin >> k >> n;
    vector<pair<int,pair<int,int> > >v(n);

    for(int i = 0;i < v.size();i++){
        cin >> v[i].fr >> v[i].sc.fr >> v[i].sc.sc;
        if(v[i].sc.sc >= (k/v[i].sc.fr))v[i].sc.sc = (k/v[i].sc.fr);
    }

    int dp[k+1] = {};

    for(int i = 0;i < v.size();i++){
        for(int j = 0;j < v[i].sc.sc;j++){
            for(int l = k;l >= v[i].sc.fr;l--){
                dp[l]=max(dp[l],dp[l-v[i].sc.fr] + v[i].fr);
            }
        }
    }

    cout << dp[k] << endl;
    
    return 0;
}

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

knapsack.cpp:2: warning: ignoring '#pragma GCC optimizate' [-Wunknown-pragmas]
    2 | #pragma GCC optimizate("Ofast")
      | 
knapsack.cpp: In function 'int32_t main()':
knapsack.cpp:33:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0;i < v.size();i++){
      |                   ~~^~~~~~~~~~
knapsack.cpp:40:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     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: 0 / 27