Submission #1101827

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1101827	2024-10-17T00:26:22 Z	bozocode	Knapsack (NOI18_knapsack)	C++14	73 / 100	1000 ms	1356 KB

knapsack

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int S, N; cin >> S >> N;
    vector<ll> value(S + 1, -1);
    value[0] = 0;
    for (int i = 0; i < N; i++) {
        int v, w, c; cin >> v >> w >> c;
        vector<ll> tmp = value;
        for (int j = 0; j < w; j++) {
            deque<ll> dq;
            for (int k = j; k < S - w + 1; k += w) {
                int idx = (k - j) / w;
                //insert
                while (!dq.empty() && dq.back() < value[k] - idx * v) { dq.pop_back(); }
                dq.push_back(value[k] - idx * v);
                if (idx >= c) {
                    int ok = k - c * w;
                    int oidx = (ok - j) / w;
                    //
                    if (!dq.empty() && dq.front() == value[ok] - oidx * v) { dq.pop_front(); }
                }
                if (dq.empty()) { continue; }
                ll best = dq.front();
                tmp[k + w] = max(tmp[k + w], best + (idx + 1) * v);
            }
        }
        value = tmp;
    }
    ll ans = 0;
    for (int i = 0; i < S + 1; i++) {
        ans = max(value[i], ans);
    }
    cout << ans << "\n";
}

Subtask #1

12.0 / 12.0

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

Subtask #2

17.0 / 17.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

24.0 / 24.0

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

Subtask #5

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	504 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	2 ms	336 KB	Output is correct
7	Correct	2 ms	336 KB	Output is correct
8	Correct	5 ms	488 KB	Output is correct
9	Correct	5 ms	336 KB	Output is correct
10	Correct	4 ms	336 KB	Output is correct
11	Correct	4 ms	336 KB	Output is correct
12	Correct	4 ms	336 KB	Output is correct
13	Correct	4 ms	336 KB	Output is correct
14	Correct	3 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	2 ms	336 KB	Output is correct
17	Correct	2 ms	336 KB	Output is correct
18	Correct	5 ms	336 KB	Output is correct
19	Correct	6 ms	336 KB	Output is correct
20	Correct	3 ms	336 KB	Output is correct
21	Correct	3 ms	336 KB	Output is correct
22	Correct	3 ms	336 KB	Output is correct
23	Correct	3 ms	336 KB	Output is correct
24	Correct	4 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	2 ms	336 KB	Output is correct
27	Correct	2 ms	504 KB	Output is correct
28	Correct	6 ms	336 KB	Output is correct
29	Correct	6 ms	336 KB	Output is correct
30	Correct	3 ms	336 KB	Output is correct
31	Correct	4 ms	336 KB	Output is correct
32	Correct	3 ms	336 KB	Output is correct
33	Correct	4 ms	484 KB	Output is correct
34	Correct	4 ms	336 KB	Output is correct
35	Correct	16 ms	336 KB	Output is correct
36	Correct	956 ms	1352 KB	Output is correct
37	Execution timed out	1045 ms	1356 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-