aboutsummaryrefslogtreecommitdiff
path: root/works
diff options
context:
space:
mode:
authorcrupest <crupest@outlook.com>2021-02-24 14:55:08 +0800
committercrupest <crupest@outlook.com>2021-02-24 14:55:08 +0800
commit765a27fc5678f3ea5ee89a7ea826dceec6aeced1 (patch)
tree19b0f182c86b8f81b4f585af4f229856a6feef94 /works
parent881f8606a183e8303e486bd433e0fd902ba86e6d (diff)
downloadcrupest-765a27fc5678f3ea5ee89a7ea826dceec6aeced1.tar.gz
crupest-765a27fc5678f3ea5ee89a7ea826dceec6aeced1.tar.bz2
crupest-765a27fc5678f3ea5ee89a7ea826dceec6aeced1.zip
import(solutions): Add acwing problem 3 (aka. complete pack problem).
Diffstat (limited to 'works')
-rw-r--r--works/solutions/acwing/3-2.cpp29
-rw-r--r--works/solutions/acwing/3.cpp29
2 files changed, 58 insertions, 0 deletions
diff --git a/works/solutions/acwing/3-2.cpp b/works/solutions/acwing/3-2.cpp
new file mode 100644
index 0000000..6565c5b
--- /dev/null
+++ b/works/solutions/acwing/3-2.cpp
@@ -0,0 +1,29 @@
+#include <algorithm>
+#include <iostream>
+
+int N, V;
+int v[1001];
+int w[1001];
+int states[1001];
+
+int main() {
+ std::cin >> N >> V;
+
+ for (int i = 1; i <= N; i++) {
+ std::cin >> v[i] >> w[i];
+ }
+
+ for (int i = 1; i <= N; i++) {
+ for (int j = 0; j <= V; j++) {
+ if (j >= v[i]) {
+ states[j] = std::max(states[j], states[j - v[i]] + w[i]);
+ } else {
+ states[j] = states[j];
+ }
+ }
+ }
+
+ std::cout << states[V];
+
+ return 0;
+}
diff --git a/works/solutions/acwing/3.cpp b/works/solutions/acwing/3.cpp
new file mode 100644
index 0000000..21bd8dc
--- /dev/null
+++ b/works/solutions/acwing/3.cpp
@@ -0,0 +1,29 @@
+#include <algorithm>
+#include <iostream>
+
+int N, V;
+int v[1001];
+int w[1001];
+int states[1001][1001];
+
+int main() {
+ std::cin >> N >> V;
+
+ for (int i = 1; i <= N; i++) {
+ std::cin >> v[i] >> w[i];
+ }
+
+ for (int i = 1; i <= N; i++) {
+ for (int j = 0; j <= V; j++) {
+ if (j >= v[i]) {
+ states[i][j] = std::max(states[i - 1][j], states[i][j - v[i]] + w[i]);
+ } else {
+ states[i][j] = states[i - 1][j];
+ }
+ }
+ }
+
+ std::cout << states[N][V];
+
+ return 0;
+}