oj.uz

Submission #976448

# Submission time Handle Problem Language Result Execution time Memory
976448 2024-05-06T14:59:45 Z vjudge1 Knapsack (NOI18_knapsack) C++11
100 / 100
 162 ms 140316 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)((x).size()))
#define pow2(x) ((ll)(x) * (x))
const ll mod = 1e9 + 7;
const int INF = 1e9 + 5; // 998244353
const ll INFF = 1e18 + 5;
// Super is the cutest girl
void solve()
{
    int s, n;
    cin >> s >> n;
    vector<pii> byweight[s + 1];

    for (int i = 0; i < n; i++)
    {
        int v, w, k;
        cin >> v >> w >> k;
        byweight[w].pb({v, k});
    }
    vector<pii> items;
    for (int w = 1; w <= s; w++)
    {
        sort(all(byweight[w]));
        int used = s / w + 1;

        while (used != 0 && !byweight[w].empty())
        {
            auto &[v, k] = byweight[w].back();
            items.pb({w, v});
            k--;
            used--;
            if (k == 0)
                byweight[w].pop_back();
        }
    }
    int sz = items.size();
    int dp[sz + 1][s + 1];
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= sz; i++)
    {

        for (int w = s; w >= 0; w--)
        {
            dp[i][w] = max(dp[i][w], dp[i - 1][w]);
            if (w - items[i - 1].first >= 0)
            {
                dp[i][w - items[i - 1].first] = max(dp[i][w - items[i - 1].first], dp[i - 1][w] + items[i - 1].second);
            }
        }
    }
    int ans = 0;
    for (auto i : dp[sz])
    {
        ans = max(ans, i);
    }
    cout << ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // int t; cin >> t; while(t--)
    solve();
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:40:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   40 |             auto &[v, k] = byweight[w].back();
      |                   ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 2 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 2 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 8028 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1628 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 8028 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1628 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 15 ms 15964 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 5 ms 6236 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1372 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 2396 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 8028 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1628 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 15 ms 15964 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 5 ms 6236 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1372 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 2396 KB Output is correct
35 Correct 21 ms 1496 KB Output is correct
36 Correct 37 ms 17004 KB Output is correct
37 Correct 38 ms 16848 KB Output is correct
38 Correct 22 ms 1496 KB Output is correct
39 Correct 26 ms 1484 KB Output is correct
40 Correct 153 ms 140316 KB Output is correct
41 Correct 104 ms 88932 KB Output is correct
42 Correct 124 ms 94244 KB Output is correct
43 Correct 162 ms 140096 KB Output is correct
44 Correct 160 ms 139512 KB Output is correct
45 Correct 50 ms 13424 KB Output is correct
46 Correct 26 ms 2764 KB Output is correct
47 Correct 52 ms 25872 KB Output is correct
48 Correct 87 ms 66388 KB Output is correct
49 Correct 25 ms 3920 KB Output is correct
50 Correct 90 ms 73808 KB Output is correct