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

• View this file on GitHub
• Last update: 2026-08-10 10:46:05+00: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)

Code

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

#include <iostream>
#include <vector>

#include "../../dp/knapsack-01-2.hpp"

using namespace std;

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"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_F
// clang-format on

#include <iostream>
#include <vector>

#line 2 "dp/knapsack-01-2.hpp"

#include <algorithm>
#include <numeric>
#line 6 "dp/knapsack-01-2.hpp"

template <typename T>
T knapsack_01_2(const std::vector<T>& w, const std::vector<int>& v,
                const T& W) {
  const int N = (int)w.size();
  const int sum = std::accumulate(v.begin(), v.end(), 0);
  std::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] = std::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 9 "test/verify/aoj-dpl-1-f.test.cpp"

using namespace std;

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	AC	3 ms	4 MB
g++	00_sample_01	AC	2 ms	4 MB
g++	01_small_00	AC	2 ms	3 MB
g++	01_small_01	AC	2 ms	4 MB
g++	01_small_02	AC	2 ms	3 MB
g++	01_small_03	AC	2 ms	4 MB
g++	02_minimum_00	AC	2 ms	4 MB
g++	02_minimum_01	AC	2 ms	3 MB
g++	03_medium_00	AC	2 ms	4 MB
g++	03_medium_01	AC	2 ms	4 MB
g++	03_medium_02	AC	2 ms	4 MB
g++	03_medium_03	AC	2 ms	4 MB
g++	04_rand_00	AC	2 ms	3 MB
g++	04_rand_01	AC	2 ms	4 MB
g++	04_rand_02	AC	2 ms	4 MB
g++	04_rand_03	AC	2 ms	4 MB
g++	05_large_00	AC	2 ms	4 MB
g++	05_large_01	AC	3 ms	4 MB
g++	05_large_02	AC	3 ms	4 MB
g++	05_large_03	AC	3 ms	3 MB
g++	05_large_04	AC	2 ms	4 MB
g++	05_large_05	AC	2 ms	3 MB
g++	06_maximum_00	AC	3 ms	4 MB
g++	06_maximum_01	AC	3 ms	3 MB
g++	06_maximum_02	AC	3 ms	3 MB
g++	06_maximum_03	AC	3 ms	4 MB
g++	07_corner_00	AC	2 ms	4 MB
g++	07_corner_01	AC	2 ms	4 MB
g++	07_corner_02	AC	2 ms	4 MB
g++	07_corner_03	AC	3 ms	4 MB
g++	07_corner_04	AC	3 ms	3 MB
g++	07_corner_05	AC	3 ms	3 MB
clang++	00_sample_00	AC	3 ms	4 MB
clang++	00_sample_01	AC	2 ms	4 MB
clang++	01_small_00	AC	2 ms	4 MB
clang++	01_small_01	AC	2 ms	4 MB
clang++	01_small_02	AC	2 ms	4 MB
clang++	01_small_03	AC	2 ms	4 MB
clang++	02_minimum_00	AC	2 ms	4 MB
clang++	02_minimum_01	AC	2 ms	4 MB
clang++	03_medium_00	AC	2 ms	4 MB
clang++	03_medium_01	AC	2 ms	4 MB
clang++	03_medium_02	AC	2 ms	4 MB
clang++	03_medium_03	AC	2 ms	4 MB
clang++	04_rand_00	AC	2 ms	4 MB
clang++	04_rand_01	AC	2 ms	4 MB
clang++	04_rand_02	AC	2 ms	4 MB
clang++	04_rand_03	AC	2 ms	4 MB
clang++	05_large_00	AC	2 ms	4 MB
clang++	05_large_01	AC	3 ms	4 MB
clang++	05_large_02	AC	2 ms	4 MB
clang++	05_large_03	AC	2 ms	4 MB
clang++	05_large_04	AC	2 ms	4 MB
clang++	05_large_05	AC	2 ms	4 MB
clang++	06_maximum_00	AC	3 ms	4 MB
clang++	06_maximum_01	AC	3 ms	4 MB
clang++	06_maximum_02	AC	3 ms	4 MB
clang++	06_maximum_03	AC	3 ms	4 MB
clang++	07_corner_00	AC	2 ms	4 MB
clang++	07_corner_01	AC	2 ms	4 MB
clang++	07_corner_02	AC	2 ms	4 MB
clang++	07_corner_03	AC	3 ms	4 MB
clang++	07_corner_04	AC	3 ms	4 MB
clang++	07_corner_05	AC	3 ms	4 MB

Back to top page