-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlec10_71.cpp
160 lines (122 loc) · 3.16 KB
/
lec10_71.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
//{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
int knapSack(vector<int>& val, vector<int>& wt, int w) {
// code here
int n = val.size();
vector<vector<int>> dp( n , vector<int>(w+1 , 0));
vector<int> prev(w+1 ,0) , cur(w+1,0);
for(int W = 0 ; W<=w ; W++){
prev[W] = ((int )(W / wt[0]))* val[0];
}
for(int ind = 1 ; ind <n; ind++){
for(int W = 0 ; W <=w;W++){
int notTake = 0 + prev[ W ];
int take = 0 ;
if(wt[ind]<= W){
take = val[ind] + cur[ W - wt[ind] ];
}
cur[W] = max(take , notTake);
}
prev = cur;
}
return prev[ w ];
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int W;
cin >> W;
cin.ignore();
string str;
getline(cin, str);
stringstream ss(str);
vector<int> val;
int num;
while (ss >> num) {
val.push_back(num);
}
string str2;
getline(cin, str2);
stringstream ss2(str2);
vector<int> wt;
int num2;
while (ss2 >> num2) {
wt.push_back(num2);
}
Solution ob;
cout << ob.knapSack(val, wt, W) << endl;
cout << "~" << endl;
}
return 0;
}
// } Driver Code Ends
// single array optimized space
//{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
int knapSack(vector<int>& val, vector<int>& wt, int w) {
// code here
int n = val.size();
vector<vector<int>> dp( n , vector<int>(w+1 , 0));
vector<int> prev(w+1 ,0) ;
for(int W = 0 ; W<=w ; W++){
prev[W] = ((int )(W / wt[0]))* val[0];
}
for(int ind = 1 ; ind <n; ind++){
for(int W = 0 ; W <=w;W++){
int notTake = 0 + prev[ W ];
int take = 0 ;
if(wt[ind]<= W){
take = val[ind] + prev[ W - wt[ind] ];
}
prev[W] = max(take , notTake);
}
}
return prev[ w ];
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int W;
cin >> W;
cin.ignore();
string str;
getline(cin, str);
stringstream ss(str);
vector<int> val;
int num;
while (ss >> num) {
val.push_back(num);
}
string str2;
getline(cin, str2);
stringstream ss2(str2);
vector<int> wt;
int num2;
while (ss2 >> num2) {
wt.push_back(num2);
}
Solution ob;
cout << ob.knapSack(val, wt, W) << endl;
cout << "~" << endl;
}
return 0;
}
// } Driver Code Ends