제출 #678442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678442		whaaaa	Knapsack (NOI18_knapsack)	C++11	12 / 100	1 ms	468 KiB

knapsack

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <math.h>
#include <utility>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <stack>
#define ll long long
#define itn int
#define all(x) x.begin(), x.end()
#define pi pair<ll,ll>
#define f first
#define sec second
#define fr front()
#define pb push_back
using namespace std;
 
bool comp(pi a, pi b){
    return a.f > b.f;
}

int main() {
    int s, n;
    cin >> s >> n;
 //   cout << "hey" << endl;
    vector<vector<pi>> a(s+1);
    for(int i = 0; i < n; i++){
        int aa,b,c;
        cin >> aa >> b >> c;
        a[b].pb({aa,c});
    }

    for(int i = 1; i <= s; i++){
        sort(all(a[i]), comp);
    }

    vector<ll> dp(s+1, -1); dp[0] = 0;
    vector<pi> used(s+1, {0,0});
  //  cout << "hey" << endl;
    for(ll i = 1; i <= s; i++){
        //cout << i << endl;
        if(a[i].empty()) continue;
        vector<ll> dp2 = dp;
        vector<pi> used2(s+1, {0,0});
        bool do1 = true, do2 = true;
        for(int j = 0; j <= s; j++){
            //cout << "\t" << j << endl;
            if(j + i > s) break;
            if(used[j].sec >= a[i][used[j].f].sec){
                used[j].sec = 0;
                used[j].f++;
            }
            if(used2[j].sec >= a[i][used2[j].f].sec){
                used2[j].sec = 0;
                
                used2[j].f++;
            }
            if(used[j].f >= a[i].size()) do1 = false;
            if(used2[j].f >= a[i].size()) do2 = false;
            if(do1 && dp[j] != -1){
                if(dp[j+i] < dp[j] + a[i][used[j].f].f){
                    used[j+i] = {used[j].f, used[j].sec+1};
                    dp[j+i] = dp[j] + a[i][used[j].f].f;
                }
            }
            if(do2 && dp2[j] != -1){
                if(dp[j+i] < dp2[j] + a[i][used2[j].f].f){
                    used2[j+i] = {used2[j].f, used2[j].sec+1};
                    dp[j+i] = dp2[j] + a[i][used2[j].f].f;
                }
            }
        }
        
        
        used = vector<pi>(s+1, {0,0});
        used2 = used;
    }
    ll ans = 0;
    for(int x = 0; x <= s; x++){
        if(dp[x] > ans){
            ans = dp[x];
        }
    }
    cout << ans;
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:62:26: 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]
   62 |             if(used[j].f >= a[i].size()) do1 = false;
knapsack.cpp:63:27: 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]
   63 |             if(used2[j].f >= a[i].size()) do2 = false;

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