제출 #709315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
709315		nima_aryan	Knapsack (NOI18_knapsack)	C++14	컴파일 에러	0 ms	0 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#ifdef LOCAL
#include "algo/debug.h"
#endif

using i64 = long long;

template<class Fun>
class y_combinator_result {
   Fun fun_;
public:
   template<class T>
   explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
 
   template<class ...Args>
   decltype(auto) operator()(Args &&...args) {
      return fun_(std::ref(*this), std::forward<Args>(args)...);
   }
};
 
template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
   return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

int main() {
   ios::sync_with_stdio(false);
   cin.tie(nullptr);
   int S, N;
   cin >> S >> N;
   vector<int> V(N + 1), W(N + 1), K(N + 1);
   for (int i = 1; i <= N; ++i) {
      cin >> V[i] >> W[i] >> K[i];
   }
   vector dp(N + 1, vector<i64>(S + 1));
   for (int i = 1; i <= N; ++i) {
      for (int sum = 0; sum <= S; ++sum) {
         for (int cnt = 0; sum - cnt * W[i] >= 0 && cnt <= K[i]; ++cnt) {
            dp[i][sum] = max(dp[i][sum], dp[i - 1][sum - cnt * W[i]] + cnt * V[i]);
         }
      }
   }
   cout << dp[N][S] << '\n';
}

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:41:11: error: missing template arguments before 'dp'
   41 |    vector dp(N + 1, vector<i64>(S + 1));
      |           ^~
knapsack.cpp:45:13: error: 'dp' was not declared in this scope
   45 |             dp[i][sum] = max(dp[i][sum], dp[i - 1][sum - cnt * W[i]] + cnt * V[i]);
      |             ^~
knapsack.cpp:49:12: error: 'dp' was not declared in this scope
   49 |    cout << dp[N][S] << '\n';
      |            ^~