oj.uz

Submission #499808

# Submission time Handle Problem Language Result Execution time Memory
499808 2021-12-29T14:55:48 Z mewnian Knapsack (NOI18_knapsack) C++14
100 / 100
 56 ms 7300 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#define sze(x) (ll) x.size()
#define idx(x, a) get<x>(a)
#define LID(x) (x << 1LL)
#define RID(x) (x << 1LL) + 1LL
#define ID(x) (x + MAXN)
#define CONV(x) (x - MAXN)
#define countbit(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pi;

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

ll rand(ll l, ll r)
{
    return uniform_int_distribution<ll>(l, r)(rng);
}

const ll MAXN = 100'003;
const ll MAXS = 2003;
const ll INF = 1e18;
const ld EPS = 1e-9;

ll n, s;
ll dp0[MAXS], dp1[MAXS];
vector<pi> a[MAXN];

void solve()
{
    fill(dp0, dp0 + s + 1, 0);
    for (ll wi = 1; wi <= s; ++wi)
    {
        if (a[wi].empty()) continue;
        sort(a[wi].begin(), a[wi].end(), greater<pi>());
        vector<ll> sumval((s / wi) + 2);
        for (ll i = 1, r = 0; i < (ll)sumval.size(); ++i)
        {
            sumval[i] = sumval[i - 1] + a[wi][r].fi * max(0LL, min(1LL, a[wi][r].se));
            --a[wi][r].se;
            while (r + 1 < (ll)a[wi].size() && a[wi][r].se == 0) ++r;
        }
        for (ll sn = 0; sn <= s; ++sn)
        {
            dp1[sn] = 0;
            for (ll i = sn, cnt = 0; i >= 0; i -= wi, ++cnt)
            {
                dp1[sn] = max(dp1[sn], dp0[i] + sumval[cnt]);
            }
        }
//        for (ll sn = 0; sn <= s; ++sn) cerr << dp1[sn] << " ";
        for (ll sn = 0; sn <= s; ++sn) dp0[sn] = dp1[sn];
//        cerr << endl;
    }
    cout << dp1[s];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    #ifdef OFFLINE
    freopen("input.inp", "r", stdin);
    #endif
    cin >> s >> n;
    for (ll i = 1; i <= n; ++i)
    {
        ll vi, wi, ki; cin >> vi >> wi >> ki;
        a[wi].pb({vi, ki});
    }
    solve();
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2656 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 5 ms 2636 KB Output is correct
3 Correct 5 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2584 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 5 ms 2636 KB Output is correct
13 Correct 5 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 2636 KB Output is correct
17 Correct 3 ms 2636 KB Output is correct
18 Correct 2 ms 2576 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 2 ms 2700 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2656 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 5 ms 2636 KB Output is correct
7 Correct 5 ms 2636 KB Output is correct
8 Correct 1 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2584 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 2636 KB Output is correct
17 Correct 5 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 5 ms 2636 KB Output is correct
21 Correct 3 ms 2636 KB Output is correct
22 Correct 2 ms 2576 KB Output is correct
23 Correct 3 ms 2636 KB Output is correct
24 Correct 2 ms 2700 KB Output is correct
25 Correct 1 ms 2636 KB Output is correct
26 Correct 3 ms 2636 KB Output is correct
27 Correct 4 ms 2636 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 1 ms 2636 KB Output is correct
30 Correct 3 ms 2636 KB Output is correct
31 Correct 3 ms 2636 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2656 KB Output is correct
5 Correct 1 ms 2636 KB Output is correct
6 Correct 5 ms 2636 KB Output is correct
7 Correct 5 ms 2636 KB Output is correct
8 Correct 1 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2584 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 5 ms 2636 KB Output is correct
17 Correct 5 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 5 ms 2636 KB Output is correct
21 Correct 3 ms 2636 KB Output is correct
22 Correct 2 ms 2576 KB Output is correct
23 Correct 3 ms 2636 KB Output is correct
24 Correct 2 ms 2700 KB Output is correct
25 Correct 1 ms 2636 KB Output is correct
26 Correct 3 ms 2636 KB Output is correct
27 Correct 4 ms 2636 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 1 ms 2636 KB Output is correct
30 Correct 3 ms 2636 KB Output is correct
31 Correct 3 ms 2636 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct
33 Correct 2 ms 2636 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 27 ms 4868 KB Output is correct
36 Correct 32 ms 4788 KB Output is correct
37 Correct 31 ms 5696 KB Output is correct
38 Correct 30 ms 5936 KB Output is correct
39 Correct 38 ms 6612 KB Output is correct
40 Correct 56 ms 7092 KB Output is correct
41 Correct 56 ms 6212 KB Output is correct
42 Correct 51 ms 6444 KB Output is correct
43 Correct 47 ms 6248 KB Output is correct
44 Correct 46 ms 6212 KB Output is correct
45 Correct 47 ms 7040 KB Output is correct
46 Correct 34 ms 6328 KB Output is correct
47 Correct 40 ms 7300 KB Output is correct
48 Correct 53 ms 7128 KB Output is correct
49 Correct 32 ms 6980 KB Output is correct
50 Correct 41 ms 6508 KB Output is correct