# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636140 | TUNGDUONGWILLWINVOI2023 | Knapsack (NOI18_knapsack) | C++14 | 1085 ms | 33172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
const int NAXM = 2e3 + 5;
int S, N, dp[NAXM];
vector<array<int, 2>> a;
int main() {
// Coding
scanf("%d%d", &S, &N);
for (int i = 0; i < N; ++i) {
int v, w, k;
scanf("%d%d%d", &v, &w, &k);
for (int j = 0; j < k; ++j) {
a.push_back({v, w});
}
}
int L = int(a.size());
for (int i = 0; i < L; ++i) {
for (int j = S; j >= 0; --j) {
if (j + a[i][1] <= S) {
dp[j + a[i][1]] = max(dp[j + a[i][1]], dp[j] + a[i][0]);
}
}
}
int ans = 0;
for (int i = 0; i <= S; ++i) {
ans = max(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |