#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<vector<ll>> value(N + 1, vector<ll>(S + 1, -1));
//O(SN) works, however the tricky part is that we have a ton of the same item
//let us not try to optimize for memory first, just time
//i think we have no need to optimize memory
value[0][0] = 0;
for (int i = 0; i < N; i++) {
int v, w, c; cin >> v >> w >> c; //value, weight, copies
//there are w distinct modulos that we can iterate over
//to cover every single value of 0... S
for (int j = 0; j < S + 1; j++) {
value[i + 1][j] = max(value[i + 1][j], value[i][j]);
}
for (int j = 0; j < w; j++) { //the mod in question
//for every value within this mod
//we want to set value[i + 1][k + w]
//to be the max of previous mods within c - 1 of it i think
//we should probably do this with multiset.. as i was doing...
multiset<ll> ms; //attempt 2
for (int k = j; k < S - w + 1; k += w) {
int idx = (k - j) / w;
// cout << k << "\n";
// cout << ms.size() << "\n";
if (value[i][k] != -1) { ms.insert(value[i][k] - idx * v); }
// cout << ms.size() << "\n";
//now what
//erase idx - c
if (idx >= c) {
//we can't be erasing 0 every time bruh this is stupid
//
int oidx = k - (c) * w;
int bruh = (oidx - j) / w;
// cout << oidx << endl;
// cout << value[i][oidx] << endl;
// cout << *ms.begin() << endl;
// cout << value[i][oidx] - bruh * v << endl;
// cout << endl;
// cout << "erasing: " << value[i][oidx] - bruh * v << "\n";
if (ms.find(value[i][oidx] - bruh * v) != ms.end()) {
ms.erase(ms.find(value[i][oidx] - bruh * v));
}
}
if (ms.empty()) { continue; }
ll best = *ms.rbegin();
// cout << best << endl;
value[i + 1][k + w] = max(value[i + 1][k + w], best + (idx + 1) * v);
}
}
// cout << "\n";
}
ll ans = 0;
// for (int i = 0; i < N + 1; i++) {
// for (int j = 0; j < S; j++) {
// cout << value[i][j] << " ";
// }
// cout << "\n";
// }
for (int i = 0; i < S + 1; i++) {
ans = max(value[N][i], ans);
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
3 ms |
1876 KB |
Output is correct |
3 |
Correct |
3 ms |
1876 KB |
Output is correct |
4 |
Correct |
2 ms |
1876 KB |
Output is correct |
5 |
Correct |
2 ms |
1996 KB |
Output is correct |
6 |
Correct |
3 ms |
1888 KB |
Output is correct |
7 |
Correct |
3 ms |
1876 KB |
Output is correct |
8 |
Correct |
3 ms |
2008 KB |
Output is correct |
9 |
Correct |
3 ms |
2040 KB |
Output is correct |
10 |
Correct |
3 ms |
1876 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
3 ms |
1876 KB |
Output is correct |
3 |
Correct |
3 ms |
1876 KB |
Output is correct |
4 |
Correct |
2 ms |
1876 KB |
Output is correct |
5 |
Correct |
2 ms |
1996 KB |
Output is correct |
6 |
Correct |
3 ms |
1888 KB |
Output is correct |
7 |
Correct |
3 ms |
1876 KB |
Output is correct |
8 |
Correct |
3 ms |
2008 KB |
Output is correct |
9 |
Correct |
3 ms |
2040 KB |
Output is correct |
10 |
Correct |
3 ms |
1876 KB |
Output is correct |
11 |
Correct |
1 ms |
504 KB |
Output is correct |
12 |
Correct |
4 ms |
2032 KB |
Output is correct |
13 |
Correct |
3 ms |
1876 KB |
Output is correct |
14 |
Correct |
2 ms |
1876 KB |
Output is correct |
15 |
Correct |
3 ms |
1876 KB |
Output is correct |
16 |
Correct |
4 ms |
2220 KB |
Output is correct |
17 |
Correct |
3 ms |
1876 KB |
Output is correct |
18 |
Correct |
3 ms |
2008 KB |
Output is correct |
19 |
Correct |
4 ms |
1876 KB |
Output is correct |
20 |
Correct |
3 ms |
1876 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
3 ms |
1876 KB |
Output is correct |
7 |
Correct |
3 ms |
1876 KB |
Output is correct |
8 |
Correct |
2 ms |
1876 KB |
Output is correct |
9 |
Correct |
2 ms |
1996 KB |
Output is correct |
10 |
Correct |
3 ms |
1888 KB |
Output is correct |
11 |
Correct |
3 ms |
1876 KB |
Output is correct |
12 |
Correct |
3 ms |
2008 KB |
Output is correct |
13 |
Correct |
3 ms |
2040 KB |
Output is correct |
14 |
Correct |
3 ms |
1876 KB |
Output is correct |
15 |
Correct |
1 ms |
504 KB |
Output is correct |
16 |
Correct |
4 ms |
2032 KB |
Output is correct |
17 |
Correct |
3 ms |
1876 KB |
Output is correct |
18 |
Correct |
2 ms |
1876 KB |
Output is correct |
19 |
Correct |
3 ms |
1876 KB |
Output is correct |
20 |
Correct |
4 ms |
2220 KB |
Output is correct |
21 |
Correct |
3 ms |
1876 KB |
Output is correct |
22 |
Correct |
3 ms |
2008 KB |
Output is correct |
23 |
Correct |
4 ms |
1876 KB |
Output is correct |
24 |
Correct |
3 ms |
1876 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
15 ms |
2144 KB |
Output is correct |
27 |
Correct |
3 ms |
1876 KB |
Output is correct |
28 |
Correct |
2 ms |
1876 KB |
Output is correct |
29 |
Correct |
2 ms |
1996 KB |
Output is correct |
30 |
Correct |
4 ms |
1876 KB |
Output is correct |
31 |
Correct |
3 ms |
2048 KB |
Output is correct |
32 |
Correct |
3 ms |
1876 KB |
Output is correct |
33 |
Correct |
4 ms |
1876 KB |
Output is correct |
34 |
Correct |
3 ms |
1876 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
3 ms |
1876 KB |
Output is correct |
7 |
Correct |
3 ms |
1876 KB |
Output is correct |
8 |
Correct |
2 ms |
1876 KB |
Output is correct |
9 |
Correct |
2 ms |
1996 KB |
Output is correct |
10 |
Correct |
3 ms |
1888 KB |
Output is correct |
11 |
Correct |
3 ms |
1876 KB |
Output is correct |
12 |
Correct |
3 ms |
2008 KB |
Output is correct |
13 |
Correct |
3 ms |
2040 KB |
Output is correct |
14 |
Correct |
3 ms |
1876 KB |
Output is correct |
15 |
Correct |
1 ms |
504 KB |
Output is correct |
16 |
Correct |
4 ms |
2032 KB |
Output is correct |
17 |
Correct |
3 ms |
1876 KB |
Output is correct |
18 |
Correct |
2 ms |
1876 KB |
Output is correct |
19 |
Correct |
3 ms |
1876 KB |
Output is correct |
20 |
Correct |
4 ms |
2220 KB |
Output is correct |
21 |
Correct |
3 ms |
1876 KB |
Output is correct |
22 |
Correct |
3 ms |
2008 KB |
Output is correct |
23 |
Correct |
4 ms |
1876 KB |
Output is correct |
24 |
Correct |
3 ms |
1876 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
15 ms |
2144 KB |
Output is correct |
27 |
Correct |
3 ms |
1876 KB |
Output is correct |
28 |
Correct |
2 ms |
1876 KB |
Output is correct |
29 |
Correct |
2 ms |
1996 KB |
Output is correct |
30 |
Correct |
4 ms |
1876 KB |
Output is correct |
31 |
Correct |
3 ms |
2048 KB |
Output is correct |
32 |
Correct |
3 ms |
1876 KB |
Output is correct |
33 |
Correct |
4 ms |
1876 KB |
Output is correct |
34 |
Correct |
3 ms |
1876 KB |
Output is correct |
35 |
Correct |
20 ms |
6996 KB |
Output is correct |
36 |
Runtime error |
188 ms |
262144 KB |
Execution killed with signal 9 |
37 |
Halted |
0 ms |
0 KB |
- |