oj.uz

Submission #563122

# Submission time Handle Problem Language Result Execution time Memory
563122 2022-05-16T10:21:51 Z HmmOkKewl Knapsack (NOI18_knapsack) C++14
100 / 100
 252 ms 247812 KB 
#include <bits/stdc++.h>

#if ONLINE_JUDGE
#define DEBUG(...)
#else
#define DEBUG(kek) cout << "DEBUG: [ " << #kek << " = " << kek << " ]\n"
#endif

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define ff first
#define ss second
#define vt(...) vector<__VA_ARGS__>
#define sz(...) (int)(__VA_ARGS__).size()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()

constexpr int M = 1000000007;
constexpr int MONKE = 0;

using namespace std;

template <typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2>& a) {
    os << "{" << a.first << ", " << a.second << "}";
    return os;
}

template <typename T>
ostream& operator<<(ostream& os, vector<T> container) {
    os << "\n[ ";
    for (auto x : container)
        os << x << " ";
    os << "]\n";
    return os;
}

template <typename T1, typename T2>
bool sort_by_second_greater(const pair<T1, T2>& a, const pair<T1, T2>& b) {
    return (a.ss > b.ss);
}

int main() {
    // unsync with C stream :)
    ios_base::sync_with_stdio(MONKE);
    cin.tie(0);
    // todo
    int S, n;
    cin >> S >> n;
    vector<tuple<int, int, int>> items(n);
    for (int i = 0; i < n; ++i) {
        int v, w, k;
        cin >> v >> w >> k;
        items[i] = {v, w, k};
    }
    vt(vt(pii)) groups(S + 1);
    for (int i = 0; i < n; ++i) {
        int idx = get<1>(items[i]);
        groups[idx].pb({get<0>(items[i]), get<2>(items[i])});
    }
    vector<int> value, weight;
    for (int i = 1; i <= S; ++i)
        sort(all(groups[i]), greater<pii>());

    int validItems = 0;
    for (int i = 1; i <= S; ++i) {
        int mxItems = S / i;
        int taken = 0;
        int itmIdx = 0;
        while (taken < mxItems && itmIdx < sz(groups[i])) {
            int takes = min(mxItems - taken, groups[i][itmIdx].ss);
            for (int j = 0; j < takes; ++j) {
                value.pb(groups[i][itmIdx].ff);
                weight.pb(i);
            }
            taken += takes;
            itmIdx++;
        }
        validItems += taken;
    }

    vt(vt(long long)) maxValue(S + 1, vt(long long)(validItems, 0));
    // cerr << value;
    // cerr << weight;
    for (int i = weight[0]; i <= S; ++i)
        maxValue[i][0] = value[0];
    for (int i = 1; i <= S; ++i) {
        for (int j = 1; j < validItems; ++j) {
            maxValue[i][j] =
                max(maxValue[i][j - 1],
                    (i >= weight[j] ? maxValue[i - weight[j]][j - 1] + value[j]
                                    : 0));
        }
    }
    cout << maxValue[S][validItems - 1];
    return MONKE;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 0 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 1828 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 2 ms 1876 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 15 ms 15700 KB Output is correct
13 Correct 3 ms 1876 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 3 ms 3796 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 2 ms 2284 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct
20 Correct 4 ms 3412 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 1828 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 2 ms 1876 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 15 ms 15700 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 3 ms 3796 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 2 ms 2284 KB Output is correct
23 Correct 3 ms 3540 KB Output is correct
24 Correct 4 ms 3412 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 29 ms 31756 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 11 ms 10580 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 2260 KB Output is correct
33 Correct 4 ms 3156 KB Output is correct
34 Correct 4 ms 4436 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 1828 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 2 ms 1876 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 15 ms 15700 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 3 ms 3796 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 2 ms 2284 KB Output is correct
23 Correct 3 ms 3540 KB Output is correct
24 Correct 4 ms 3412 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 29 ms 31756 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 11 ms 10580 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 2260 KB Output is correct
33 Correct 4 ms 3156 KB Output is correct
34 Correct 4 ms 4436 KB Output is correct
35 Correct 30 ms 3660 KB Output is correct
36 Correct 60 ms 35004 KB Output is correct
37 Correct 57 ms 34748 KB Output is correct
38 Correct 32 ms 4020 KB Output is correct
39 Correct 37 ms 4716 KB Output is correct
40 Correct 252 ms 247812 KB Output is correct
41 Correct 158 ms 145608 KB Output is correct
42 Correct 169 ms 156092 KB Output is correct
43 Correct 241 ms 247372 KB Output is correct
44 Correct 229 ms 246348 KB Output is correct
45 Correct 50 ms 22348 KB Output is correct
46 Correct 34 ms 4544 KB Output is correct
47 Correct 70 ms 43828 KB Output is correct
48 Correct 134 ms 115812 KB Output is correct
49 Correct 35 ms 6092 KB Output is correct
50 Correct 146 ms 145356 KB Output is correct