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<vector<int>> a;
  31.  
  32. int consistency(int n, int m){
  33.  
  34.     vector<int> fixed(n, 0);
  35.  
  36.     for(int i=0; i<n; i++){
  37.         int x = a[i][0];    
  38.         for(int j=0; j<n; j++){
  39.             int y = a[j][0];
  40.             if(i==j) continue;  
  41.             if(y%x == 0) fixed[i]++;
  42.         }   
  43.     }   
  44.  
  45.  
  46.     vector<vector<int>> dp0(n+1, vector<int>(m+1, 0));
  47.     vector<vector<int>> dp1(n+1, vector<int>(m+1, 0));  
  48.  
  49.     dp0[0][0] = 0;
  50.     dp1[0][0] = 0;  
  51.  
  52.  
  53.     for(int i=1; i<=n; i++){
  54.         int price = a[i-1][1];  
  55.  
  56.         for(int j=0; j<=m; j++){
  57.  
  58.             dp0[i][j] = max(dp0[i-1][j], dp1[i-1][j]);  
  59.  
  60.             int firstItem = 0;
  61.             if(j-price >= 0)    firstItem = dp0[i][j-price] + 1 + fixed[i-1];  
  62.  
  63.             int atleastTwoItems = 0;
  64.             if(j-price >= 0)    atleastTwoItems = dp1[i][j-price] + 1;  
  65.  
  66.             dp1[i][j] = max(firstItem, atleastTwoItems);
  67.         }
  68.     }   
  69.  
  70.     return max( dp0[n][m], dp1[n][m] );
  71.  
  72. }
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88. int practice(int n, int m){
  89.  
  90.  
  91.     return 0;
  92. }
  93.  
  94.  
  95.  
  96.  
  97.  
  98. void solve() {
  99.  
  100.     int n, m;
  101.     cin>> n >> m;
  102.  
  103.     a.resize(n, vector<int>(2));
  104.     for(int i=0; i<n; i++){
  105.     	int x;
  106.     	int y;
  107.     	cin >> x >> y;
  108.     	a[i] = {x,y};
  109.     }
  110.  
  111.     cout << consistency(n, m) << endl;
  112.  
  113.  
  114. }
  115.  
  116.  
  117.  
  118.  
  119.  
  120. int32_t main() {
  121.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  122.  
  123.     int t = 1;
  124.     // cin >> t;
  125.     while (t--) {
  126.         solve();
  127.     }
  128.  
  129.     return 0;
  130. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
3 9
6 2 
2 6
3 4
stdout
copy 
4
https://ideone.com/RxgPCx
language:
C++14 (gcc 8.3)
created:
1 day 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!