| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 914407 | Em1L | Knapsack (NOI18_knapsack) | C++17 | 3 ms | 348 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    freopen("input.txt", "r", stdin);
    int n, s; cin >> s >> n;
    vector < pii > val;
    for (int i = 1, v, w, k; i <= n; i++) {
        cin >> v >> w >> k;
        for (int p = 0; p <= 30; p++)
            if ((1 << p) <= k) {
                val.push_back({ v * (1 << p), w * (1 << p) });
                k -= 1 << p;
            }
    }
    vector < int > dp(s + 1, -1);
    dp[0] = 0;
    for (auto [v, w] : val) {
        if (w > s)
            continue;
        for (int cur = s; cur >= w; cur--)
            if (dp[cur - w] >= 0)
                dp[cur] = max(dp[cur], dp[cur - w] + v);
    }
    cout << *max_element(dp.begin(), dp.end()) << "\n";
}
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... | ||||
