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> a;
  31. vector<int> p;
  32.  
  33. int consistency1(int n, int c){
  34.  
  35. 	vector<vector<int>> dp(n+1, vector<int>(c+1, 0));
  36.  
  37. 	dp[0][0] = 0;
  38.  
  39. 	for(int i=1; i<=n; i++){
  40. 		for(int j=0; j<=c; j++){
  41.  
  42. 			int k = 0;
  43. 			while(j-k*a[i-1] >= 0){
  44. 				dp[i][j] = max(dp[i][j], dp[i-1][j-k*a[i-1]] + k*p[i-1]);
  45. 				k++;
  46. 			}
  47. 		}
  48. 	}
  49.  
  50. 	return dp[n][c];
  51. }
  52.  
  53.  
  54.  
  55. int consistency2(int n, int c){
  56.  
  57. 	vector<vector<int>> dp(n+1, vector<int>(c+1, 0));
  58.  
  59. 	dp[0][0] = 0;
  60.  
  61. 	for(int i=1; i<=n; i++){
  62. 		for(int j=0; j<=c; j++){
  63.  
  64. 			dp[i][j] = dp[i-1][j];
  65. 			if(j-a[i-1]>=0) dp[i][j] = max(dp[i][j], p[i-1] + dp[i][j-a[i-1]]);
  66. 		}
  67. 	}
  68.  
  69. 	return dp[n][c];
  70. }
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82. int practice(int n){
  83.  
  84.  
  85.     return 0;
  86. }
  87.  
  88.  
  89.  
  90.  
  91.  
  92. void solve() {
  93.  
  94.     int n, c;
  95.     cin>> n >> c;
  96.  
  97.     a.resize(n);
  98.     p.resize(n);
  99.     for(int i=0; i<n; i++) cin >> a[i];
  100.     for(int i=0; i<n; i++) cin >> p[i];
  101.  
  102.     cout << consistency1(n, c) << " " << consistency2(n, c) << endl;
  103.  
  104.  
  105. }
  106.  
  107.  
  108.  
  109.  
  110.  
  111. int32_t main() {
  112.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  113.  
  114.     int t = 1;
  115.     // cin >> t;
  116.     while (t--) {
  117.         solve();
  118.     }
  119.  
  120.     return 0;
  121. }
Success #stdin #stdout 0s 5304KB
comments (?)
stdin
copy 
3 21
5 5 8
10 12 100
stdout
copy 
212 212
https://ideone.com/q1Gyoc
language:
C++14 (gcc 8.3)
created:
3 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!