제출 #652346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652346		chanhchuong123	Knapsack (NOI18_knapsack)	C++14	17 / 100	1 ms	340 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define task "C"
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
  if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
  if (a < b) {a = b; return true;} return false;
}

const int S = 2020;
int s, n;
long long dp[S];
vector<long long> v;
vector<long long> w;

main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  if (fopen(task".inp","r")) {
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);
  }

  cin >> s >> n;
  for (int i = 1; i <= n; i++) {
    int V, W, K; cin >> V >> W >> K;
    for (int j = 30; j >= 0; j--) if (K >> j & 1) {
      v.push_back((1LL << j) * V);
      w.push_back((1LL << j) * W);
      K -= (1 << j);
    }
    if (K) {
      v.push_back(1LL * K * V);
      w.push_back(1LL * K * W);
    }
  }
  n = v.size();
  for (int i = 0; i < n; i++) {
    for (int j = s; j >= 0; j--) {
      if (j + w[i] > s) continue;
      maxi(dp[j + w[i]], dp[j] + v[i]);
    }
  }
  cout << *max_element(dp + 1, dp + 1 + s);
}

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

knapsack.cpp:22:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main() {
      | ^~~~
knapsack.cpp: In function 'int main()':
knapsack.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen(task".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:28:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     freopen(task".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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