This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ei1333/library
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_C" #include "../../template/template.hpp" #include "../../dp/knapsack.hpp" int main() { int N, W; cin >> N >> W; vector< int > v(N), w(N); for(int i = 0; i < N; i++) cin >> v[i] >> w[i]; auto ret = knapsack(w, v, W, -1); cout << *max_element(begin(ret), end(ret)) << endl; }
#line 1 "test/verify/aoj-dpl-1-c.test.cpp" #define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_C" #line 1 "template/template.hpp" #include<bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 >& p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { explicit FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } #line 4 "test/verify/aoj-dpl-1-c.test.cpp" #line 1 "dp/knapsack.hpp" template< typename T, typename Compare = greater< T > > vector< T > knapsack(const vector< int > &w, const vector< T > &v, const int &W, const T &NG, const Compare &comp = Compare()) { const int N = (int) w.size(); vector< T > dp(W + 1, NG); dp[0] = T(); for(int i = 0; i < N; i++) { for(int j = w[i]; j <= W; j++) { if(dp[j - w[i]] != NG) { if(comp(dp[j - w[i]] + v[i], dp[j])) { dp[j] = dp[j - w[i]] + v[i]; } } } } return dp; } #line 6 "test/verify/aoj-dpl-1-c.test.cpp" int main() { int N, W; cin >> N >> W; vector< int > v(N), w(N); for(int i = 0; i < N; i++) cin >> v[i] >> w[i]; auto ret = knapsack(w, v, W, -1); cout << *max_element(begin(ret), end(ret)) << endl; }