제출 #691981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691981		ngobinh0312	Knapsack (NOI18_knapsack)	C++14	0 / 100	15 ms	31924 KiB

knapsack

#include <bits/stdc++.h>


#define all(x) x.begin(), x.end()
#define r_all(x) x.rbegin(), x.rend()
#define sz(x)(ll) x.size()
#define g_max(x, y) x = max(x, y)
#define g_min(x, y) x = min(x, y)
#define rsz(a, n) a.resize(n)
#define ass(a, n) a.assign(n, 0)
#define YES() cout << "YES\n"
#define Yes cout << "Yes\n"
#define NO() cout << "NO\n"
#define No() cout << "No\n"
#define n_line() cout << "\n"

using namespace std;

using ll = long long;
using ld = long double;

using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using stkll = stack<ll>;
using qll = queue<ll>;
using dqll = deque<ll>;
using sll = set<ll>;
using sc = set<char>;
using msll = multiset<ll>;
using mll = map<ll, ll>;

using vsll = vector<sll>;

using pcll = pair<char, ll>;

template<class T>
vector<T> operator+(vector<T> a, vector<T> b) {
    a.insert(a.end(), b.begin(), b.end());
    return a;
}

pll operator+(pll a, pll b) {
    pll ans = {a.first + b.first, a.second + b.second};
    return ans;
}

template<class A, class B>
ostream &operator<<(ostream &os,
                    const pair<A, B> &p) {
    os << p.first << " " << p.second;
    return os;
}

template<class A, class B>
istream &operator>>(istream &is, pair<A, B> &p) {
    is >> p.first >> p.second;
    return is;
}

template<class T>
ostream &operator<<(ostream &os,
                    const vector<T> &vec) {
    for (auto &x: vec) {
        os << x << " ";
    }

    return os;
}

template<class T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (auto &x: vec) {
        is >> x;
    }

    return is;
}


template<class T>
ostream &operator<<(ostream &os,
                    const set<T> &vec) {
    for (auto &x: vec) {
        os << x << " ";
    }

    return os;
}

template<class A, class B>
ostream &operator<<(ostream &os,
                    const map<A, B> d) {
    for (auto &x: d) {
        os << "(" << x.first << " " << x.second << ") ";
    }

    return os;
}

template<class A>
void read_arr(A a[], ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        cin >> a[i];
    }
}

template<class A>
void print_arr(A a[], ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        cout << a[i] << " ";
    }
    cout << "\n";
}

template<class A>
void set_arr(A a[], A val, ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        a[i] = val;
    }
}

ll dr[] = {0, 1, 0, -1}, dc[] = {-1, 0, 1, 0};

//ll dr[] = {1, 0}, dc[] = {0, 1};

const ll INF = 1e18;
ll MOD = 1e9 + 7;

struct Dsu {
    ll n;
    vll par;

    void init(ll n_sz) {
        n = n_sz;
        par.assign(n, 0);

        for (ll i = 0; i < n; i++) {
            par[i] = i;
        }
    }

    ll find_st(ll v) {
        return (par[v] == v) ? par[v] : par[v] = find_st(par[v]);
    }

    ll union_st(ll u, ll v) {
        u = find_st(u), v = find_st(v);

        if (u == v) {
            return 0;
        }

        par[v] = u;
        return 1;
    }
};


void memset64(ll dest[], ll val, ll sz) {
    for (ll i = 0; i < sz; i++) {
        dest[i] = val;
    }
}

ll square(ll u) {
    return u * u;
}

void print(ll a[], ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        cout << a[i] << " ";
    }

    cout << "\n";
}


ll gcd_extended(ll a, ll b, ll *x, ll *y) {
    if (a == 0) {
        *x = 0LL, *y = 1LL;
        return b;
    }

    ll x1, y1;
    ll g = gcd_extended(b % a, a, &x1, &y1);
    *x = y1 - (b / a) * x1;
    *y = x1;

    return g;
}

ll mod_pow(ll p, ll n, ll mod = MOD) {
    ll res = 1;

    while (n) {
        if (n & 1) {
            res = (res * p) % mod;
        }

        p = (p * p) % mod;
        n >>= 1;
    }

    return res;
}

ll mod_inverse(ll b, ll mod = MOD) {
    ll x, y;
    ll g = gcd_extended(b, mod, &x, &y);

    if (g != 1) {
        return -1;
    }

    return mod_pow(b, mod - 2, mod);

}

ll mod_add(ll a, ll b, ll mod = MOD) {
    return (a + b) % mod;
}

ll mod_sub(ll a, ll b, ll mod = MOD) {
    return (a - b + mod) % mod;
}

ll mod_mul(ll a, ll b, ll mod = MOD) {
    return ((a % mod) * (b % mod)) % mod;
}

ll mod_div(ll a, ll b, ll mod = MOD) {
    a %= mod;
    ll inv = mod_inverse(b, mod) % mod;
    if (inv == -1) {
        return -1;
    }

    return (a * inv) % mod;
}


ll mod_fact(ll n) {
    if (n < 0) {
        return 0;
    }

    ll ans = 1;
    for (ll i = 2; i <= n; i++) {
        ans *= i;
        ans %= MOD;
    }

    return ans;

}

ll mod_sigma(ll x, ll mod = MOD) {
    ll ans = 1;
    ans = (ans * x) % mod;
    ans = (ans * (x + 1)) % mod;
    ans = mod_div(ans, 2) % mod;
    return ans;
}

ll is_palindrome(string &str) {
    string rev = str;
    reverse(all(str));
    return rev == str;
}

const ll N = 2e3 + 10;

ll n, m, k, q;
ll a[N], b[N], c[N];
//vvll grid;
string s, s1, s2;

map<ll, vpll> dict;
vector<pair<ll, vpll>> vec;
ll dp[N][N];

void init() {
}


ll get_ans() {
    for (auto &r: dp) {
        memset64(r, -INF, N);
    }

    dp[0][0] = 0;
    vec.clear();
    vec.emplace_back(0, vpll());

    for (auto &p: dict) {
        vec.emplace_back(p);
    }

//    cout << vec << "\n";

    for (ll i = 1; i < sz(vec); i++) {
        auto [weight, items] = vec[i];
        sort(all(items));
        ll w = 0, v = 0;

        for (ll j = 1; j <= m; j++) {
            g_max(dp[i][j], dp[i - 1][j]);
            if (j >= w) {
                g_max(dp[i][j], dp[i - 1][j - w] + v);
            }

            for (; !items.empty(); ) {
                if (items.back().second == 0) {
                    items.pop_back();
                    continue;
                }

                w += weight;
                v += items.back().first;
                items.back().second--;

                if (w > j) {
                    break;
                }

//                cout << make_pair(dp[i - 1][j - w], v) << "\n";

                g_max(dp[i][j], dp[i - 1][j - w] + v);
            }

            if (j >= w) {
                g_max(dp[i][j], dp[i - 1][j - w] + v);
            }

        }


    }

//    for (ll i = 1; i < sz(vec); i++) {
//        for (ll j = 0; j <= m; j++) {
//            cout << dp[i][j] << " ";
//        }
//        cout << "\n";
//    }

    return *max_element(dp[sz(vec) - 1] + 1, dp[sz(vec) - 1] + 1 + m);


}


void single(ll t_id = 0) {
    cin >> m >> n;

    dict.clear();
    for (ll i = 0; i < n; i++) {
        ll v, copy, w;
        cin >> v >> w >> copy;
        dict[w].emplace_back(v, copy);
    }

    cout << get_ans() << "\n";

}

void multiple() {
    init();

    ll t;
    cin >> t;

    for (ll i = 0; i < t; i++) {
        single(i);
    }

}

//#endif

#if 0

void multiple() {
    while (cin >> n >> m) {
        if (n == 0 && m == 0) {
            break;
        }

        single();
    }

#endif

int main(int argc, char *argv[]) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

//    freopen("feast.in", "r", stdin);
//    freopen("feast.out", "w", stdout);

//    freopen("../input.txt", "r", stdin);
//    freopen("../output.txt", "w", stdout);
//    multiple();
    single();


    return 0;


};

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'll get_ans()':
knapsack.cpp:307:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  307 |         auto [weight, items] = vec[i];
      |              ^

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