fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> c;
  31. vector<int> h;
  32. vector<int> x;
  33. vector<int> y;
  34.  
  35. int consistency(int n, int m){
  36.  
  37. 	vector<vector<int>> dp(n+1, vector<int>(m+1, -INF));
  38.  
  39. 	dp[0][0] = 0;
  40.  
  41. 	for(int i=1; i<=n; i++){
  42. 		for(int j=0; j<=m; j++){
  43.  
  44. 			int xi = x[i-1];
  45. 			int yi = y[i-1];
  46.  
  47. 			for(int k=xi; k<=yi; k++){
  48. 				if(j-k*c[i-1] >= 0 && dp[i-1][j-k*c[i-1]] >= 0){
  49. 					dp[i][j] = max(dp[i][j], dp[i-1][j-k*c[i-1]] + k*h[i-1]);
  50. 				}
  51. 			}
  52. 		}
  53. 	}
  54.  
  55. 	return dp[n][m];
  56. }
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72. int practice(int n){
  73.  
  74.  
  75.     return 0;
  76. }
  77.  
  78.  
  79.  
  80.  
  81.  
  82. void solve() {
  83.  
  84.     int n, m;
  85.     cin>> n >> m;
  86.  
  87.     c.resize(n);
  88.     h.resize(n);
  89.     x.resize(n);
  90.     y.resize(n);
  91.     for(int i=0; i<n; i++) cin >> c[i];
  92.     for(int i=0; i<n; i++) cin >> h[i];
  93.     for(int i=0; i<n; i++) cin >> x[i];
  94.     for(int i=0; i<n; i++) cin >> y[i];
  95.  
  96.     cout << consistency(n, m) << endl;
  97.  
  98.  
  99. }
  100.  
  101.  
  102.  
  103.  
  104.  
  105. int32_t main() {
  106.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  107.  
  108.     int t = 1;
  109.     // cin >> t;
  110.     while (t--) {
  111.         solve();
  112.     }
  113.  
  114.     return 0;
  115. }
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin
copy 
2 20
5 5
100 1
1 1
3 2
stdout
copy 
301
https://ideone.com/XDDnCk
language:
C++14 (gcc 8.3)
created:
4 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!