Submission #517018

# Submission time Handle Problem Language Result Execution time Memory
517018 2022-01-22T11:24:57 Z DiTenix Knapsack (NOI18_knapsack) C++17
100 / 100
97 ms 35136 KB
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define sz(x) int((x).size())
#define ALL(x) (x).begin(),(x).end()
#define ln cout << '\n'
#define REP(i, a) for (int i = 0; i < int(a); i++)
#define FOR(i, a) for (int i = 1; i <= int(a); i++)
#define MEM(a,b) memset((a),(b),sizeof(a))
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
using namespace std;
#include <bits/stdc++.h>
using ll = long long;
using vi = vector<int>;
template<typename T> void rd(vector<T> &a) {for (auto &ele : a) cin >> ele;}
template<typename T> void writeln(vector<T> &a) {for (auto &ele : a) cout << ele << ' '; cout << "\n";}
#if __cplusplus > 201402L
template<typename... Args> void rd(Args&... args) {((cin >> args), ...);}
template<typename... Args> void write(Args... args) {((cout << args << " "), ...);}
template<typename... Args> void writeln(Args... args) {((cout << args << " "), ...); cout << "\n";}
#endif
const int maxn = 1e6 + 5;

ll v[maxn], w[maxn], k[maxn];
ll dp[2005][2005];
struct item {
    int v, k;
};
vector<item> b[2005];
signed main()
{

    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
//    int t;cin >> t;while(t--) solve();
    int n, S;
    cin >> S >> n;
    FOR(i, n) {
        int v, w, k;
        rd(v, w, k);
        b[w].pb({v, k});
    }
    REP(i, 2005) REP(j, 2005) dp[i][j] = -INF;
    dp[0][0] = 0;
    int at = 0;
    for (int w = 1; w <= S; ++w) {
        if (b[w].empty()) continue;
        at++;
        sort(ALL(b[w]), [](item & a, item & b) {
            return a.v > b.v;
        });
        auto& items = b[w];
        for (int i = 0; i <= S; ++i) {
            dp[at][i] = dp[at - 1][i];
            int copy = 0;
            int type_at = 0;
            int curr_used = 0;
            ll value = 0;
            while ((copy + 1) * w <= i && type_at < sz(items)) {
                copy++;
                value += items[type_at].v;

                if (dp[at - 1][i - copy * w] != - INF) {
                    dp[at][i] = max(
                                    dp[at][i],
                                    dp[at - 1][i - copy * w] + value
                                );

                }

                curr_used++;
                if (curr_used == items[type_at].k) {
                    curr_used = 0;
                    type_at++;
                }
            }
        }
    }
    ll res = 0;
    for (int i = 0; i <= S; ++i) {
        res = max(res, dp[at][i]);
    }
    writeln(res);
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 14 ms 31820 KB Output is correct
3 Correct 14 ms 31800 KB Output is correct
4 Correct 13 ms 31820 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 31816 KB Output is correct
2 Correct 14 ms 31712 KB Output is correct
3 Correct 13 ms 31736 KB Output is correct
4 Correct 15 ms 31812 KB Output is correct
5 Correct 13 ms 31748 KB Output is correct
6 Correct 14 ms 31796 KB Output is correct
7 Correct 14 ms 31716 KB Output is correct
8 Correct 18 ms 31708 KB Output is correct
9 Correct 14 ms 31708 KB Output is correct
10 Correct 14 ms 31740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 31816 KB Output is correct
2 Correct 14 ms 31712 KB Output is correct
3 Correct 13 ms 31736 KB Output is correct
4 Correct 15 ms 31812 KB Output is correct
5 Correct 13 ms 31748 KB Output is correct
6 Correct 14 ms 31796 KB Output is correct
7 Correct 14 ms 31716 KB Output is correct
8 Correct 18 ms 31708 KB Output is correct
9 Correct 14 ms 31708 KB Output is correct
10 Correct 14 ms 31740 KB Output is correct
11 Correct 13 ms 31768 KB Output is correct
12 Correct 15 ms 31820 KB Output is correct
13 Correct 14 ms 31824 KB Output is correct
14 Correct 15 ms 31820 KB Output is correct
15 Correct 14 ms 31792 KB Output is correct
16 Correct 14 ms 31708 KB Output is correct
17 Correct 19 ms 31820 KB Output is correct
18 Correct 14 ms 31832 KB Output is correct
19 Correct 15 ms 31720 KB Output is correct
20 Correct 15 ms 31820 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 14 ms 31820 KB Output is correct
3 Correct 14 ms 31800 KB Output is correct
4 Correct 13 ms 31820 KB Output is correct
5 Correct 14 ms 31816 KB Output is correct
6 Correct 14 ms 31712 KB Output is correct
7 Correct 13 ms 31736 KB Output is correct
8 Correct 15 ms 31812 KB Output is correct
9 Correct 13 ms 31748 KB Output is correct
10 Correct 14 ms 31796 KB Output is correct
11 Correct 14 ms 31716 KB Output is correct
12 Correct 18 ms 31708 KB Output is correct
13 Correct 14 ms 31708 KB Output is correct
14 Correct 14 ms 31740 KB Output is correct
15 Correct 13 ms 31768 KB Output is correct
16 Correct 15 ms 31820 KB Output is correct
17 Correct 14 ms 31824 KB Output is correct
18 Correct 15 ms 31820 KB Output is correct
19 Correct 14 ms 31792 KB Output is correct
20 Correct 14 ms 31708 KB Output is correct
21 Correct 19 ms 31820 KB Output is correct
22 Correct 14 ms 31832 KB Output is correct
23 Correct 15 ms 31720 KB Output is correct
24 Correct 15 ms 31820 KB Output is correct
25 Correct 13 ms 31776 KB Output is correct
26 Correct 15 ms 31776 KB Output is correct
27 Correct 15 ms 31820 KB Output is correct
28 Correct 15 ms 31784 KB Output is correct
29 Correct 13 ms 31740 KB Output is correct
30 Correct 16 ms 31820 KB Output is correct
31 Correct 16 ms 31752 KB Output is correct
32 Correct 14 ms 31820 KB Output is correct
33 Correct 15 ms 31772 KB Output is correct
34 Correct 14 ms 31824 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 14 ms 31820 KB Output is correct
3 Correct 14 ms 31800 KB Output is correct
4 Correct 13 ms 31820 KB Output is correct
5 Correct 14 ms 31816 KB Output is correct
6 Correct 14 ms 31712 KB Output is correct
7 Correct 13 ms 31736 KB Output is correct
8 Correct 15 ms 31812 KB Output is correct
9 Correct 13 ms 31748 KB Output is correct
10 Correct 14 ms 31796 KB Output is correct
11 Correct 14 ms 31716 KB Output is correct
12 Correct 18 ms 31708 KB Output is correct
13 Correct 14 ms 31708 KB Output is correct
14 Correct 14 ms 31740 KB Output is correct
15 Correct 13 ms 31768 KB Output is correct
16 Correct 15 ms 31820 KB Output is correct
17 Correct 14 ms 31824 KB Output is correct
18 Correct 15 ms 31820 KB Output is correct
19 Correct 14 ms 31792 KB Output is correct
20 Correct 14 ms 31708 KB Output is correct
21 Correct 19 ms 31820 KB Output is correct
22 Correct 14 ms 31832 KB Output is correct
23 Correct 15 ms 31720 KB Output is correct
24 Correct 15 ms 31820 KB Output is correct
25 Correct 13 ms 31776 KB Output is correct
26 Correct 15 ms 31776 KB Output is correct
27 Correct 15 ms 31820 KB Output is correct
28 Correct 15 ms 31784 KB Output is correct
29 Correct 13 ms 31740 KB Output is correct
30 Correct 16 ms 31820 KB Output is correct
31 Correct 16 ms 31752 KB Output is correct
32 Correct 14 ms 31820 KB Output is correct
33 Correct 15 ms 31772 KB Output is correct
34 Correct 14 ms 31824 KB Output is correct
35 Correct 37 ms 32696 KB Output is correct
36 Correct 40 ms 32708 KB Output is correct
37 Correct 43 ms 33800 KB Output is correct
38 Correct 42 ms 34100 KB Output is correct
39 Correct 47 ms 34836 KB Output is correct
40 Correct 88 ms 35020 KB Output is correct
41 Correct 64 ms 34284 KB Output is correct
42 Correct 70 ms 34320 KB Output is correct
43 Correct 81 ms 34280 KB Output is correct
44 Correct 97 ms 34320 KB Output is correct
45 Correct 48 ms 35096 KB Output is correct
46 Correct 42 ms 34612 KB Output is correct
47 Correct 55 ms 35136 KB Output is correct
48 Correct 64 ms 35028 KB Output is correct
49 Correct 39 ms 34900 KB Output is correct
50 Correct 66 ms 34720 KB Output is correct