Advertisement
Rofyda_Elghadban1

Untitled

Jan 26th, 2024
916
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.32 KB | None | 0 0
  1.  #include <bits/stdc++.h>
  2.  #define ll long long
  3.  #define ull unsigned long long
  4.  #define pi 3.141592654
  5.  #define NUM 1e18
  6.  #define Mod  1'000'000'007
  7.  #define fixed(n) fixed<<setprecision(n)
  8.  #define cin(v) for(auto &i:v) cin >> i ;
  9.  #define cout(v) for(auto &i:v) cout << i  <<" ";
  10.  #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
  11.  #define small(x) (x>=97&&x<=122)
  12.  #define capital(x) (x>=65&&x<=90)
  13.  #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
  14.  #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
  15.  #define sz(x) (int)(x.size())
  16.  #define all(v) ((v).begin()), ((v).end())
  17.  #define allr(v) ((v).rbegin()), ((v).rend())
  18.  #define updmax(a,b) a=max(a,b)
  19.  #define updmin(a,b) a=min(a,b)
  20.  #define ceil(a,b) ((a/b)+(a%b?1:0))
  21.  /* asc -> 1 2 3 ,des -> 3 2 1 */
  22.  
  23.  /***********************************************************************************/
  24.  using namespace std;
  25.  void Rofyda_Elghadban(){
  26.   #ifndef ONLINE_JUDGE  
  27.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  28.    #endif
  29.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  30.  }
  31.  
  32.  bool cookies(int n,int c,int k,vector<int>&a,vector<int>&b){
  33.   int d=0;
  34.   for(int i=0;i<n;i++){
  35.     if(b[i]/a[i]<c){
  36.       d=c-(b[i]/a[i]);
  37.       if(d==1){
  38.         if(k-(a[i]-(b[i]%a[i]))>=0){
  39.           b[i]+=(a[i]-(b[i]%a[i]));
  40.           k-=(a[i]-(b[i]%a[i]));
  41.         }else{
  42.           return false;
  43.         }
  44.       }else{
  45.         if(k-(a[i]-(b[i]%a[i]))>=0){
  46.           b[i]+=(a[i]-(b[i]%a[i]));
  47.           k-=(a[i]-(b[i]%a[i]));
  48.         }else{
  49.           return false;
  50.         }
  51.         d--;
  52.         if(k-(a[i]*d)>=0){
  53.           b[i]+=(a[i]*d);
  54.           k-=(a[i]*d);
  55.         }else{
  56.           return false;
  57.         }
  58.       }
  59.     }else{
  60.       return true;
  61.     }
  62.   }return true;
  63.  }
  64.  
  65.  void solve(){
  66.   int n,k;
  67.   cin>>n>>k;
  68.   vector<int>a(n),b(n),v;
  69.   cin(a);
  70.   cin(b);
  71.   for(int i=0;i<n;i++){
  72.     v.push_back(b[i]/a[i]);
  73.   }
  74.   sort(all(v));
  75.   int l=0,r=n,ans=-1;
  76.   while(l<=r){
  77.     int mid=l+(r-l)/2;
  78.     if(cookies(n,v[mid],k,a,b)){
  79.       l=mid+1;
  80.       ans=mid;
  81.     }else{
  82.       r=mid-1;
  83.     }
  84.   }
  85.   cout<<ans<<"\n";
  86.  }
  87.  
  88.  int main(){
  89.   Rofyda_Elghadban();
  90.   // int t;
  91.   // cin>>t;
  92.   // while(t--){
  93.   //   solve();
  94.   // }
  95.   solve();
  96.   return 0;
  97.  }
  98.  
  99.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement