/*____________________________________________________________
// started :
// finished:
// problem : https://oj.uz/problem/view/NOI18_knapsack
____________________________________________________________*/
#include <bits/stdc++.h>
#define FOR(n) for (int i = 0;i < n;i++)
#define FORO(n) for (int i = 1;i < n;i++)
#define ROF(n) for (int i = n - 1;i >= 0;i--)
#define ROFO(n) for (int i = n - 1;i >= 1;i--)
#define loop while (true) // rust woooo
#define ALL(arr) arr.begin(), arr.end()
#define lower lower_bound
#define upper upper_bound
#define ll long long
#define uint unsigned int
#define hashmap unordered_map
#define hashset unordered_set
#define p_queue priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define f first
#define s second
#define endl "\n"
#define BIG_NUMBER 1e18
#define BIG_PRIME 999998727899999 // this number has 15 digits
#define PRIME32 1e9 + 7
#define ASCII_PRIME 257
#define ALPHA_PRIME 29
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// maxWeight is S from the problem statement, can't use s as variable name
// because macro though
int maxW, n; cin >> maxW >> n;
// key -> weight, e.f -> val, e.s -> cnt
map<int, vector<pair<int, int>>> items;
FOR(n) {
int val, weight, cnt; cin >> val >> weight >> cnt;
if (weight <= maxW) {
items[weight].pb({ val, cnt });
}
}
vector<vector<ll>> dp(items.size() + 1, vector<ll>(maxW + 1, -1));
dp[0][0] = 0;
ll ans = -1;
int itemIndex = 1;
for (auto& currBatch : items) {
int itemW = currBatch.f;
vector<pair<int, int>>& currItems = currBatch.s;
sort(ALL(currItems), greater<pair<int, int>>());
FOR(maxW + 1) {
dp[itemIndex][i] = dp[itemIndex - 1][i];
int copies = 0, wI = 0, currCnt = 0;
ll val = 0;
// this dp updates curr from prev, which is opposite of what I was
// trying to do in my other solution, which is updating next from
// curr
while (((copies + 1) * itemW <= i) && (wI < currItems.size())) {
copies++;
val += currItems[wI].f;
if (dp[itemIndex - 1][i - (copies * itemW)] != -1) {
dp[itemIndex][i] = max(dp[itemIndex][i], dp[itemIndex - 1][i - (copies * itemW)] + val);
ans = max(ans, dp[itemIndex][i]);
}
currCnt++;
if (currCnt == currItems[wI].s) {
wI++;
currCnt = 0;
}
}
}
itemIndex++;
}
cout << ans;
return 0;
}
Compilation message
knapsack.cpp: In function 'int main()':
knapsack.cpp:71:55: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
71 | while (((copies + 1) * itemW <= i) && (wI < currItems.size())) {
| ~~~^~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
312 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 |
2 ms |
1748 KB |
Output is correct |
7 |
Correct |
2 ms |
1856 KB |
Output is correct |
8 |
Correct |
2 ms |
1748 KB |
Output is correct |
9 |
Correct |
2 ms |
1732 KB |
Output is correct |
10 |
Correct |
2 ms |
1748 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
312 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 |
2 ms |
1748 KB |
Output is correct |
7 |
Correct |
2 ms |
1856 KB |
Output is correct |
8 |
Correct |
2 ms |
1748 KB |
Output is correct |
9 |
Correct |
2 ms |
1732 KB |
Output is correct |
10 |
Correct |
2 ms |
1748 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
3 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
320 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
0 ms |
340 KB |
Output is correct |
16 |
Correct |
2 ms |
1852 KB |
Output is correct |
17 |
Correct |
2 ms |
1748 KB |
Output is correct |
18 |
Correct |
2 ms |
1856 KB |
Output is correct |
19 |
Correct |
2 ms |
1748 KB |
Output is correct |
20 |
Correct |
2 ms |
1876 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
312 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
2 ms |
1748 KB |
Output is correct |
11 |
Correct |
2 ms |
1856 KB |
Output is correct |
12 |
Correct |
2 ms |
1748 KB |
Output is correct |
13 |
Correct |
2 ms |
1732 KB |
Output is correct |
14 |
Correct |
2 ms |
1748 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
3 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
320 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
1852 KB |
Output is correct |
21 |
Correct |
2 ms |
1748 KB |
Output is correct |
22 |
Correct |
2 ms |
1856 KB |
Output is correct |
23 |
Correct |
2 ms |
1748 KB |
Output is correct |
24 |
Correct |
2 ms |
1876 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
4 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
0 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
3 ms |
1876 KB |
Output is correct |
31 |
Correct |
2 ms |
1856 KB |
Output is correct |
32 |
Correct |
2 ms |
1748 KB |
Output is correct |
33 |
Correct |
2 ms |
1748 KB |
Output is correct |
34 |
Correct |
3 ms |
1748 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
312 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
2 ms |
1748 KB |
Output is correct |
11 |
Correct |
2 ms |
1856 KB |
Output is correct |
12 |
Correct |
2 ms |
1748 KB |
Output is correct |
13 |
Correct |
2 ms |
1732 KB |
Output is correct |
14 |
Correct |
2 ms |
1748 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
3 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
320 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
0 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
1852 KB |
Output is correct |
21 |
Correct |
2 ms |
1748 KB |
Output is correct |
22 |
Correct |
2 ms |
1856 KB |
Output is correct |
23 |
Correct |
2 ms |
1748 KB |
Output is correct |
24 |
Correct |
2 ms |
1876 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
4 ms |
340 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
0 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
3 ms |
1876 KB |
Output is correct |
31 |
Correct |
2 ms |
1856 KB |
Output is correct |
32 |
Correct |
2 ms |
1748 KB |
Output is correct |
33 |
Correct |
2 ms |
1748 KB |
Output is correct |
34 |
Correct |
3 ms |
1748 KB |
Output is correct |
35 |
Correct |
29 ms |
2308 KB |
Output is correct |
36 |
Correct |
32 ms |
2440 KB |
Output is correct |
37 |
Correct |
27 ms |
2376 KB |
Output is correct |
38 |
Correct |
30 ms |
2620 KB |
Output is correct |
39 |
Correct |
38 ms |
3260 KB |
Output is correct |
40 |
Correct |
103 ms |
35132 KB |
Output is correct |
41 |
Correct |
78 ms |
34404 KB |
Output is correct |
42 |
Correct |
78 ms |
34416 KB |
Output is correct |
43 |
Correct |
97 ms |
34428 KB |
Output is correct |
44 |
Correct |
94 ms |
34376 KB |
Output is correct |
45 |
Correct |
41 ms |
6796 KB |
Output is correct |
46 |
Correct |
31 ms |
3148 KB |
Output is correct |
47 |
Correct |
46 ms |
10068 KB |
Output is correct |
48 |
Correct |
65 ms |
19332 KB |
Output is correct |
49 |
Correct |
33 ms |
3864 KB |
Output is correct |
50 |
Correct |
59 ms |
3916 KB |
Output is correct |