제출 #553157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
553157		ljuba	Knapsack (NOI18_knapsack)	C++17	100 / 100	62 ms	3860 KiB

knapsack

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
/*
погледај сампле тестове, пре него што имплементираш (можда имаш погрешну идеју) 
уместо да разматраш неке глупе случајеве на папиру, размишљај заправо о задатку
*/

const ll INF = 1e18 + 12;

void solve() {
    int s, n;
    cin >> s >> n;

    vpii kand[s+1];

    for(int i = 0; i < n; ++i) {
        int v, w, k;
        cin >> v >> w >> k;
        assert(w <= s);
        kand[w].pb({v, k});
    }

    for(int i = 1; i <= s; ++i) {
        sort(all(kand[i]));
    }

    vpii v;

    for(int i = 1; i <= s; ++i) {
        int uzmi = s / i;

        while(uzmi && sz(kand[i])) {
            --uzmi;
            --kand[i].back().se;

            v.pb({i, kand[i].back().first});

            if(kand[i].back().se == 0) {
                kand[i].pop_back();
            }
        }
    }

    dbg(v);

    ll dp[s+1];
    for(int i = 0; i <= s; ++i) dp[i] = -INF;
    dp[0] = 0;

    for(int iter = 0; iter < sz(v); ++iter) {
        auto tren = v[iter];
        for(int i = s; i >= 0; --i) {
            if(i + tren.fi > s) continue;
            ckmax(dp[i+tren.fi], dp[i] + tren.se);
        }
    }

    ll ans = -INF;
    for(int i = 1; i <= s; ++i) ckmax(ans, dp[i]);

    cout << ans << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
}

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