diff options
| author | crupest <crupest@outlook.com> | 2021-02-24 15:32:25 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-24 15:32:25 +0800 |
| commit | a14a096c787a71f6e60a108f9640b6127b997404 (patch) | |
| tree | 8b1d3ac568d85e20e2c06cca9cdb8bc95433464a /works | |
| parent | 765a27fc5678f3ea5ee89a7ea826dceec6aeced1 (diff) | |
| download | crupest-a14a096c787a71f6e60a108f9640b6127b997404.tar.gz crupest-a14a096c787a71f6e60a108f9640b6127b997404.tar.bz2 crupest-a14a096c787a71f6e60a108f9640b6127b997404.zip | |
import(solutions): Add acwing problem 4 (aka multiple pack problem).
Diffstat (limited to 'works')
| -rw-r--r-- | works/solutions/acwing/2-2.cpp | 8 | ||||
| -rw-r--r-- | works/solutions/acwing/3-2.cpp | 8 | ||||
| -rw-r--r-- | works/solutions/acwing/4.cpp | 51 |
3 files changed, 55 insertions, 12 deletions
diff --git a/works/solutions/acwing/2-2.cpp b/works/solutions/acwing/2-2.cpp index de812f4..fb0fb3b 100644 --- a/works/solutions/acwing/2-2.cpp +++ b/works/solutions/acwing/2-2.cpp @@ -14,12 +14,8 @@ int main() { }
for (int i = 1; i <= N; i++) {
- for (int j = V; j >= 0; j--) {
- if (j >= v[i]) {
- states[j] = std::max(states[j], states[j - v[i]] + w[i]);
- } else {
- states[j] = states[j];
- }
+ for (int j = V; j >= v[i]; j--) {
+ states[j] = std::max(states[j], states[j - v[i]] + w[i]);
}
}
diff --git a/works/solutions/acwing/3-2.cpp b/works/solutions/acwing/3-2.cpp index 6565c5b..c099838 100644 --- a/works/solutions/acwing/3-2.cpp +++ b/works/solutions/acwing/3-2.cpp @@ -14,12 +14,8 @@ int main() { }
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];
- }
+ for (int j = v[i]; j <= V; j++) {
+ states[j] = std::max(states[j], states[j - v[i]] + w[i]);
}
}
diff --git a/works/solutions/acwing/4.cpp b/works/solutions/acwing/4.cpp new file mode 100644 index 0000000..3270402 --- /dev/null +++ b/works/solutions/acwing/4.cpp @@ -0,0 +1,51 @@ +#include <algorithm>
+#include <iostream>
+
+int N, V;
+int v[101];
+int w[101];
+int s[101];
+int states[101];
+
+void CompletePack(int v, int w) {
+ for (int j = v; j <= V; j++) {
+ states[j] = std::max(states[j], states[j - v] + w);
+ }
+}
+
+void ZeroOnePack(int v, int w) {
+ for (int j = V; j >= v; j--) {
+ states[j] = std::max(states[j], states[j - v] + w);
+ }
+}
+
+int main() {
+ std::cin >> N >> V;
+
+ for (int i = 1; i <= N; i++) {
+ std::cin >> v[i] >> w[i] >> s[i];
+ }
+
+ for (int i = 1; i <= N; i++) {
+ if (v[i] * s[i] >= V) {
+ CompletePack(v[i], w[i]);
+ } else {
+ int k = 1;
+ int amount = s[i];
+
+ while (k < amount) {
+ ZeroOnePack(k * v[i], k * w[i]);
+ amount -= k;
+ k *= 2;
+ }
+
+ if (amount != 0) {
+ ZeroOnePack(amount * v[i], amount * w[i]);
+ }
+ }
+ }
+
+ std::cout << states[V];
+
+ return 0;
+}
|