oj.uz

Submission #471839

# Submission time Handle Problem Language Result Execution time Memory
471839 2021-09-11T05:53:14 Z CodeChamp_SS Knapsack (NOI18_knapsack) C++17
100 / 100
 114 ms 36352 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define ff                  first
#define ss                  second
#define pb                  push_back
#define eb                  emplace_back
#define mp                  make_pair
#define lb                  lower_bound
#define ub                  upper_bound
#define setbits(x)          __builtin_popcountll(x)
#define zrobits(x)          __builtin_ctzll(x)
#define sz(v)               (int)v.size()
#define ps(y)               cout << fixed << setprecision(y)
#define ms(arr, v)          memset(arr, v, sizeof(arr))
#define all(v)              v.begin(), v.end()
#define rall(v)             v.rbegin(), v.rend()
#define trav(x, v)          for(auto &x: v)
#define w(t)                int t; cin >> t; while(t--)
#define rep(i, a, b)        for(int i = a; i <= b; i++)
#define rrep(i, a, b)       for(int i = a; i >= b; i--)
#define rep0(i, n)          rep(i, 0, n - 1)
#define rrep0(i, n)         rrep(i, n - 1, 0)
#define rep1(i, n)          rep(i, 1, n)
#define rrep1(i, n)         rrep(i, n, 1)
#define inp(arr, n)         rep0(i, n) cin >> arr[i];

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef map<ll, ll> mii;
typedef map<char, ll> mci;
typedef priority_queue<ll> pq_mx;
typedef priority_queue<ll, vi, greater<>> pq_mn;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> pbds;
/*
 * find_by_order(i) -> returns an iterator to the element at ith position (0 based)
 * order_of_key(i)  -> returns the position of element i (0 based)
 */

const int N = 2e3 + 5;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const ll inf = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void fio() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
}

int n, s;
ll dp[N][N];
vp wt[N];

int main() {
    fio();

    cin >> s >> n;
    rep0(x, n) {
        ll v, w, k;
        cin >> v >> w >> k;
        wt[w].eb(v, k);
    }

    ms(dp, -1);
    dp[0][0] = 0;
    rep1(x, s) {
        sort(rall(wt[x]));
        rep0(i, s + 1) {
            dp[x][i] = dp[x - 1][i];
            ll cur = 0, pre = 0;
            int j = 0, ki = 0;
            while ((cur + 1) * x <= i and j < sz(wt[x])) {
                ++cur, pre += wt[x][j].ff;
                if (dp[x - 1][i - cur * x] != -1) dp[x][i] = max(dp[x][i], pre + dp[x - 1][i - cur * x]);
                ++ki;
                if (ki == wt[x][j].ss) ki = 0, ++j;
            }
        }
    }
    ll res = 0;
    rep0(x, s + 1) res = *max_element(dp[x], dp[x] + s + 1);
    cout << res;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31820 KB Output is correct
2 Correct 21 ms 31828 KB Output is correct
3 Correct 21 ms 31820 KB Output is correct
4 Correct 20 ms 31824 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31780 KB Output is correct
2 Correct 27 ms 31844 KB Output is correct
3 Correct 26 ms 31844 KB Output is correct
4 Correct 27 ms 31836 KB Output is correct
5 Correct 35 ms 31828 KB Output is correct
6 Correct 33 ms 31820 KB Output is correct
7 Correct 27 ms 31820 KB Output is correct
8 Correct 32 ms 31740 KB Output is correct
9 Correct 27 ms 31820 KB Output is correct
10 Correct 27 ms 31732 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31780 KB Output is correct
2 Correct 27 ms 31844 KB Output is correct
3 Correct 26 ms 31844 KB Output is correct
4 Correct 27 ms 31836 KB Output is correct
5 Correct 35 ms 31828 KB Output is correct
6 Correct 33 ms 31820 KB Output is correct
7 Correct 27 ms 31820 KB Output is correct
8 Correct 32 ms 31740 KB Output is correct
9 Correct 27 ms 31820 KB Output is correct
10 Correct 27 ms 31732 KB Output is correct
11 Correct 14 ms 31820 KB Output is correct
12 Correct 37 ms 31820 KB Output is correct
13 Correct 32 ms 31820 KB Output is correct
14 Correct 33 ms 31820 KB Output is correct
15 Correct 27 ms 31820 KB Output is correct
16 Correct 28 ms 31816 KB Output is correct
17 Correct 28 ms 31840 KB Output is correct
18 Correct 28 ms 31740 KB Output is correct
19 Correct 28 ms 31836 KB Output is correct
20 Correct 28 ms 31820 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31820 KB Output is correct
2 Correct 21 ms 31828 KB Output is correct
3 Correct 21 ms 31820 KB Output is correct
4 Correct 20 ms 31824 KB Output is correct
5 Correct 15 ms 31780 KB Output is correct
6 Correct 27 ms 31844 KB Output is correct
7 Correct 26 ms 31844 KB Output is correct
8 Correct 27 ms 31836 KB Output is correct
9 Correct 35 ms 31828 KB Output is correct
10 Correct 33 ms 31820 KB Output is correct
11 Correct 27 ms 31820 KB Output is correct
12 Correct 32 ms 31740 KB Output is correct
13 Correct 27 ms 31820 KB Output is correct
14 Correct 27 ms 31732 KB Output is correct
15 Correct 14 ms 31820 KB Output is correct
16 Correct 37 ms 31820 KB Output is correct
17 Correct 32 ms 31820 KB Output is correct
18 Correct 33 ms 31820 KB Output is correct
19 Correct 27 ms 31820 KB Output is correct
20 Correct 28 ms 31816 KB Output is correct
21 Correct 28 ms 31840 KB Output is correct
22 Correct 28 ms 31740 KB Output is correct
23 Correct 28 ms 31836 KB Output is correct
24 Correct 28 ms 31820 KB Output is correct
25 Correct 14 ms 31820 KB Output is correct
26 Correct 31 ms 31908 KB Output is correct
27 Correct 33 ms 31696 KB Output is correct
28 Correct 27 ms 31840 KB Output is correct
29 Correct 26 ms 31792 KB Output is correct
30 Correct 28 ms 31820 KB Output is correct
31 Correct 28 ms 31836 KB Output is correct
32 Correct 27 ms 31740 KB Output is correct
33 Correct 28 ms 31804 KB Output is correct
34 Correct 28 ms 31816 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31820 KB Output is correct
2 Correct 21 ms 31828 KB Output is correct
3 Correct 21 ms 31820 KB Output is correct
4 Correct 20 ms 31824 KB Output is correct
5 Correct 15 ms 31780 KB Output is correct
6 Correct 27 ms 31844 KB Output is correct
7 Correct 26 ms 31844 KB Output is correct
8 Correct 27 ms 31836 KB Output is correct
9 Correct 35 ms 31828 KB Output is correct
10 Correct 33 ms 31820 KB Output is correct
11 Correct 27 ms 31820 KB Output is correct
12 Correct 32 ms 31740 KB Output is correct
13 Correct 27 ms 31820 KB Output is correct
14 Correct 27 ms 31732 KB Output is correct
15 Correct 14 ms 31820 KB Output is correct
16 Correct 37 ms 31820 KB Output is correct
17 Correct 32 ms 31820 KB Output is correct
18 Correct 33 ms 31820 KB Output is correct
19 Correct 27 ms 31820 KB Output is correct
20 Correct 28 ms 31816 KB Output is correct
21 Correct 28 ms 31840 KB Output is correct
22 Correct 28 ms 31740 KB Output is correct
23 Correct 28 ms 31836 KB Output is correct
24 Correct 28 ms 31820 KB Output is correct
25 Correct 14 ms 31820 KB Output is correct
26 Correct 31 ms 31908 KB Output is correct
27 Correct 33 ms 31696 KB Output is correct
28 Correct 27 ms 31840 KB Output is correct
29 Correct 26 ms 31792 KB Output is correct
30 Correct 28 ms 31820 KB Output is correct
31 Correct 28 ms 31836 KB Output is correct
32 Correct 27 ms 31740 KB Output is correct
33 Correct 28 ms 31804 KB Output is correct
34 Correct 28 ms 31816 KB Output is correct
35 Correct 55 ms 34032 KB Output is correct
36 Correct 77 ms 33672 KB Output is correct
37 Correct 66 ms 34564 KB Output is correct
38 Correct 65 ms 35052 KB Output is correct
39 Correct 86 ms 35724 KB Output is correct
40 Correct 114 ms 36128 KB Output is correct
41 Correct 91 ms 35396 KB Output is correct
42 Correct 90 ms 35452 KB Output is correct
43 Correct 112 ms 35380 KB Output is correct
44 Correct 109 ms 35440 KB Output is correct
45 Correct 73 ms 36144 KB Output is correct
46 Correct 70 ms 35380 KB Output is correct
47 Correct 77 ms 36352 KB Output is correct
48 Correct 86 ms 36036 KB Output is correct
49 Correct 65 ms 35964 KB Output is correct
50 Correct 102 ms 35564 KB Output is correct