제출 #933865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933865		Akshat369	Knapsack (NOI18_knapsack)	C++17	49 / 100	105 ms	262144 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF (int)1e18
#define endl '\n'
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
#define f first
#define s second
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define rrep(i, a, b) for(int i = (a); i > (b); i--)
#define vi vector<int>
#define pii pair<int, int>

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() {
    int n , s; cin>>s>>n;
    vector<pair<int,int>> a;
    a.push_back({0,0});
    for (int i = 0; i < n; ++i) {
        int u , v , k; cin>>u>>v>>k;
        for (int j = 0; j < min(k,(s/v)); ++j) {
            a.push_back({u,v}); // value and weight
        }
    }
    vector<vector<int> > dp(a.size()+1 , vector<int> (s+1));
    for(int i = 1 ; i <= a.size() ; i++){
        for(int j = 1 ; j <= s ; j++){
            dp[i][j] = dp[i-1][j];
            if (a[i].second<=j){
                dp[i][j] = max(dp[i-1][j],dp[i-1][j-a[i].second] + a[i].first);
            }
         //   cout<<dp[i][j]<<" ";
        }
        //cout<<endl;
    }
    cout<< dp[a.size()][s]<<endl;
}

int32_t main() {
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(0);



    int t = 1;
 //   cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

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

knapsack.cpp: In function 'void Solve()':
knapsack.cpp:29:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i = 1 ; i <= a.size() ; i++){
      |                     ~~^~~~~~~~~~~

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