test/aoj/DPL_1_F/main.test.cpp
Depends on
Code
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_F"
#include <iostream>
#include <vector>
#include "Mylib/IO/input_tuple_vector.cpp"
#include "Mylib/Typical/knapsack_small_value.cpp"
namespace hl = haar_lib;
int main() {
int N;
std::cin >> N;
int64_t W;
std::cin >> W;
auto [v, w] = hl::input_tuple_vector<int64_t, int64_t>(N);
auto ans = hl::knapsack_small_value(N, W, w, v);
std::cout << ans << std::endl;
return 0;
}
#line 1 "test/aoj/DPL_1_F/main.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_F"
#include <iostream>
#include <vector>
#line 2 "Mylib/IO/input_tuple_vector.cpp"
#include <initializer_list>
#line 4 "Mylib/IO/input_tuple_vector.cpp"
#include <tuple>
#include <utility>
#line 7 "Mylib/IO/input_tuple_vector.cpp"
namespace haar_lib {
template <typename T, size_t... I>
void input_tuple_vector_init(T &val, int N, std::index_sequence<I...>) {
(void) std::initializer_list<int>{(void(std::get<I>(val).resize(N)), 0)...};
}
template <typename T, size_t... I>
void input_tuple_vector_helper(T &val, int i, std::index_sequence<I...>) {
(void) std::initializer_list<int>{(void(std::cin >> std::get<I>(val)[i]), 0)...};
}
template <typename... Args>
auto input_tuple_vector(int N) {
std::tuple<std::vector<Args>...> ret;
input_tuple_vector_init(ret, N, std::make_index_sequence<sizeof...(Args)>());
for (int i = 0; i < N; ++i) {
input_tuple_vector_helper(ret, i, std::make_index_sequence<sizeof...(Args)>());
}
return ret;
}
} // namespace haar_lib
#line 2 "Mylib/Typical/knapsack_small_value.cpp"
#include <algorithm>
#include <climits>
#include <numeric>
#line 6 "Mylib/Typical/knapsack_small_value.cpp"
namespace haar_lib {
template <typename Weight, typename Value>
Value knapsack_small_value(int N, Weight cap, const std::vector<Weight> &w, const std::vector<Value> &v) {
const Value MAX_V = std::accumulate(v.begin(), v.end(), 0);
std::vector<std::vector<Value>> dp(N + 1, std::vector<Value>(MAX_V + 1, LLONG_MAX));
dp[0][0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= MAX_V; ++j) {
dp[i + 1][j] = std::min(dp[i + 1][j], dp[i][j]);
if (j + v[i] <= MAX_V and dp[i][j] < LLONG_MAX) {
dp[i + 1][j + v[i]] = std::min(dp[i + 1][j + v[i]], dp[i][j] + w[i]);
}
}
}
Value ret = 0;
for (int i = 0; i <= MAX_V; ++i) {
if (dp[N][i] <= cap) ret = i;
}
return ret;
}
} // namespace haar_lib
#line 7 "test/aoj/DPL_1_F/main.test.cpp"
namespace hl = haar_lib;
int main() {
int N;
std::cin >> N;
int64_t W;
std::cin >> W;
auto [v, w] = hl::input_tuple_vector<int64_t, int64_t>(N);
auto ans = hl::knapsack_small_value(N, W, w, v);
std::cout << ans << std::endl;
return 0;
}
Back to top page
Input tuple vector
(Mylib/IO/input_tuple_vector.cpp)