結果
問題 | No.37 遊園地のアトラクション |
ユーザー |
![]() |
提出日時 | 2015-08-19 22:35:48 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 3 ms / 5,000 ms |
コード長 | 1,651 bytes |
コンパイル時間 | 1,701 ms |
コンパイル使用メモリ | 163,872 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-10 13:03:27 |
合計ジャッジ時間 | 2,780 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>using namespace std;template<typename Weight, typename Value> Value knapsack(Weight maxWeight, const vector<Weight>& weight, const vector<Value>& value) {vector<Value> dp1(maxWeight + Weight(1)), dp2(maxWeight + Weight(1));for (size_t i = 0; i < weight.size(); ++i) {for (int w = 0; w <= maxWeight; ++w) {Weight ww = Weight(w) + weight[i];Value vv = dp1[w] + value[i];if (ww <= maxWeight && dp2[ww] < vv) dp2[ww] = vv;}dp1 = dp2;}return dp1[maxWeight];}template<typename Weight, typename Value = long long> vector<Value> knapsackCount(Weight maxWeight, const vector<Weight>& weight) {vector<Value> dp1(maxWeight + Weight(1)), dp2(maxWeight + Weight(1));dp1[0] = dp2[0] = 1;for (auto& w : weight) {for (int i = 0; i <= maxWeight; ++i) {Weight ww = Weight(i) + w;if (ww <= maxWeight) dp2[ww] += dp1[i];}dp1 = dp2;}return dp1;}template<typename Weight> vector<bool> knapsackFill(Weight maxWeight, const vector<Weight>& weight) {vector<bool> dp1(maxWeight + Weight(1)), dp2(maxWeight + Weight(1));dp1[0] = dp2[0] = true;for (auto& w : weight) {for (int i = 0; i <= maxWeight; ++i) {Weight ww = Weight(i) + w;if (ww <= maxWeight && dp1[i]) dp2[ww] = true;}dp1 = dp2;}return dp1;}int main() {int t, n;cin >> t >> n;vector<int> c(n), v(n);for (int& i : c) cin >> i;for (int& i : v) cin >> i;for (int i = 0; i < n; ++i) {for (int vv = v[i] / 2; vv; vv /= 2) {c.emplace_back(c[i]);v.emplace_back(vv);}}cout << knapsack(t, c, v) << endl;}