제출 #976367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976367		vjudge1	Knapsack (NOI18_knapsack)	C++17	100 / 100	53 ms	4948 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

#define info tuple<int, int, int>

void solve() {
  int s,n;cin>>s>>n;

  vector<vector<int>> available(s+1, vector<int>());

  vector<info> cakes(n);
  for (int i = 0; i < n; i++) {
    int v,w,k;cin>>v>>w>>k;
    cakes[i] = {v, w, k};
  }

  sort(all(cakes), [&](auto x, auto y) {
    return get<0>(x) > get<0>(y);
  });

  for (auto [v, w, k] : cakes) {
    for (int i = 0; i < k; i++) {
      if (available[w].size() >= s/w) break;
      available[w].push_back(v);
    }
  }


  vector<pair<int, int>> a;
  for (int w = 0; w <= s; w++) for (auto v : available[w]) a.push_back({w, v});
  vector<int> dp(s+1);

  for (auto [w, v] : a) {
    for (int j = s; j >= 0; j--) {
      if (j + w > s) continue; 
      dp[j+w] = max(dp[j+w], dp[j] + v);
    }
  }

  cout << *max_element(all(dp)) << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

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

knapsack.cpp: In function 'void solve()':
knapsack.cpp:39:31: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   39 |       if (available[w].size() >= s/w) break;
      |           ~~~~~~~~~~~~~~~~~~~~^~~~~~

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