diff options
| author | crupest <crupest@outlook.com> | 2021-02-24 15:35:13 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-24 15:35:13 +0800 |
| commit | 3a3f0c3b0a19306bc9dfd901516de1c9c9d6f3ef (patch) | |
| tree | 4049457d4264f85b15ba16219f97717d640aaccd | |
| parent | b65d176c4c13fc916f09c192af97fc2edd5faa90 (diff) | |
| download | crupest-3a3f0c3b0a19306bc9dfd901516de1c9c9d6f3ef.tar.gz crupest-3a3f0c3b0a19306bc9dfd901516de1c9c9d6f3ef.tar.bz2 crupest-3a3f0c3b0a19306bc9dfd901516de1c9c9d6f3ef.zip | |
import(solutions): Add acwing problem 5.
| -rw-r--r-- | works/solutions/acwing/5.cpp | 51 |
1 files changed, 51 insertions, 0 deletions
diff --git a/works/solutions/acwing/5.cpp b/works/solutions/acwing/5.cpp new file mode 100644 index 0000000..e451a2d --- /dev/null +++ b/works/solutions/acwing/5.cpp @@ -0,0 +1,51 @@ +#include <algorithm>
+#include <iostream>
+
+int N, V;
+int v[1001];
+int w[1001];
+int s[1001];
+int states[2001];
+
+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;
+}
|