test/verify/aoj-dpl-1-f.test.cpp

• View this file on GitHub
• Last update: 2024-04-24 02:34:04+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_F

Depends on

• Knapsack 01(0-1ナップサック問題) $O(N \sum {v_i})$ (dp/knapsack-01-2.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_F

#include "../../template/template.hpp"

#include "../../dp/knapsack-01-2.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];
  cout << knapsack_01_2(w, v, W) << endl;
}

#line 1 "test/verify/aoj-dpl-1-f.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_F

#line 1 "template/template.hpp"
#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

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-f.test.cpp"

#line 1 "dp/knapsack-01-2.hpp"
template< typename T >
T knapsack_01_2(const vector< T > &w, const vector< int > &v, const T &W) {
  const int N = (int) w.size();
  const int sum = accumulate(begin(v), end(v), 0);
  vector< T > dp(sum + 1, W + 1);
  dp[0] = T();
  for(int i = 0; i < N; i++) {
    for(int j = sum; j >= v[i]; j--) {
      dp[j] = min(dp[j], dp[j - v[i]] + w[i]);
    }
  }
  int ret = 0;
  for(int i = 0; i <= sum; i++) {
    if(dp[i] <= W) ret = i;
  }
  return ret;
}
#line 6 "test/verify/aoj-dpl-1-f.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];
  cout << knapsack_01_2(w, v, W) << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	4 MB
g++	00_sample_01.in	AC	6 ms	4 MB
g++	01_small_00.in	AC	6 ms	4 MB
g++	01_small_01.in	AC	6 ms	4 MB
g++	01_small_02.in	AC	6 ms	4 MB
g++	01_small_03.in	AC	6 ms	4 MB
g++	02_minimum_00.in	AC	6 ms	4 MB
g++	02_minimum_01.in	AC	6 ms	4 MB
g++	03_medium_00.in	AC	6 ms	4 MB
g++	03_medium_01.in	AC	6 ms	4 MB
g++	03_medium_02.in	AC	6 ms	4 MB
g++	03_medium_03.in	AC	6 ms	4 MB
g++	04_rand_00.in	AC	5 ms	4 MB
g++	04_rand_01.in	AC	6 ms	4 MB
g++	04_rand_02.in	AC	6 ms	4 MB
g++	04_rand_03.in	AC	6 ms	4 MB
g++	05_large_00.in	AC	6 ms	4 MB
g++	05_large_01.in	AC	7 ms	4 MB
g++	05_large_02.in	AC	6 ms	4 MB
g++	05_large_03.in	AC	6 ms	4 MB
g++	05_large_04.in	AC	6 ms	4 MB
g++	05_large_05.in	AC	6 ms	4 MB
g++	06_maximum_00.in	AC	6 ms	4 MB
g++	06_maximum_01.in	AC	6 ms	4 MB
g++	06_maximum_02.in	AC	6 ms	4 MB
g++	06_maximum_03.in	AC	6 ms	4 MB
g++	07_corner_00.in	AC	6 ms	4 MB
g++	07_corner_01.in	AC	5 ms	4 MB
g++	07_corner_02.in	AC	6 ms	4 MB
g++	07_corner_03.in	AC	6 ms	4 MB
g++	07_corner_04.in	AC	7 ms	4 MB
g++	07_corner_05.in	AC	7 ms	4 MB
clang++	00_sample_00.in	AC	6 ms	4 MB
clang++	00_sample_01.in	AC	6 ms	4 MB
clang++	01_small_00.in	AC	6 ms	4 MB
clang++	01_small_01.in	AC	6 ms	4 MB
clang++	01_small_02.in	AC	6 ms	4 MB
clang++	01_small_03.in	AC	6 ms	4 MB
clang++	02_minimum_00.in	AC	6 ms	4 MB
clang++	02_minimum_01.in	AC	6 ms	4 MB
clang++	03_medium_00.in	AC	6 ms	4 MB
clang++	03_medium_01.in	AC	6 ms	4 MB
clang++	03_medium_02.in	AC	6 ms	4 MB
clang++	03_medium_03.in	AC	5 ms	4 MB
clang++	04_rand_00.in	AC	6 ms	4 MB
clang++	04_rand_01.in	AC	6 ms	4 MB
clang++	04_rand_02.in	AC	6 ms	4 MB
clang++	04_rand_03.in	AC	6 ms	4 MB
clang++	05_large_00.in	AC	6 ms	4 MB
clang++	05_large_01.in	AC	6 ms	4 MB
clang++	05_large_02.in	AC	6 ms	4 MB
clang++	05_large_03.in	AC	6 ms	4 MB
clang++	05_large_04.in	AC	6 ms	4 MB
clang++	05_large_05.in	AC	6 ms	4 MB
clang++	06_maximum_00.in	AC	6 ms	4 MB
clang++	06_maximum_01.in	AC	6 ms	4 MB
clang++	06_maximum_02.in	AC	7 ms	4 MB
clang++	06_maximum_03.in	AC	6 ms	4 MB
clang++	07_corner_00.in	AC	6 ms	4 MB
clang++	07_corner_01.in	AC	5 ms	4 MB
clang++	07_corner_02.in	AC	6 ms	4 MB
clang++	07_corner_03.in	AC	7 ms	4 MB
clang++	07_corner_04.in	AC	6 ms	4 MB
clang++	07_corner_05.in	AC	6 ms	4 MB

Back to top page