Submission #828543

#	Time	Username	Problem	Language	Result	Execution time	Memory
828543		Nelt	Knapsack (NOI18_knapsack)	C++17	37 / 100	193 ms	262144 KiB

knapsack

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 2005;
ll dp[N][N];
vv(ll) v[N];
void solve()
{
    ll s, n;
    cin >> s >> n;
    while (n--)
    {
        ll x, y, z;
        cin >> x >> y >> z;
        while (z--)
            v[y].pb(x);
    }
    ll ans = 0;
    for (ll i = 1; i <= s; i++)
    {
        for (ll j = 0; j <= s; j++)
            dp[i][j] = dp[i - 1][j];
        sort(allc(v[i]), greater());
        for (ll j = i; j <= s; j++)
        for (ll k = 0, sum = 0; k < min((ll)v[i].size(), j / i); k++)
            sum += v[i][k], dp[i][j] = max(dp[i][j], dp[i - 1][j - (k + 1) * i] + sum);
    }
    for (ll i = 0; i <= s; i++)
        ans = max(ans, dp[s][i]);
    cout << ans << endl;
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

• Subtask 1: 0 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27