7oSkaaa

E

Jun 30th, 2022 (edited)
956
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.19 KB | None
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  6. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  7. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  8. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  9. #define fixed(n) fixed << setprecision(n)
  10. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  11. #define fill(vec, value) memset(vec, value, sizeof(vec));
  12. #define Num_of_Digits(n) ((int)log10(n) + 1)
  13. #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
  14. #define all(vec) vec.begin(), vec.end()
  15. #define rall(vec) vec.rbegin(), vec.rend()
  16. #define sz(x) int(x.size())
  17. #define debug(x) cout << #x << ": " << (x) << "\n";
  18. #define fi first
  19. #define se second
  20. #define ll long long
  21. #define ull unsigned long long
  22. #define Mod  1'000'000'007
  23. #define OO 2'000'000'000
  24. #define EPS 1e-9
  25. #define PI acos(-1)
  26. template < typename T = int > using Pair = pair < T, T >;
  27.  
  28. template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
  29.     for (auto &x: v) in >> x;
  30.     return in;
  31. }
  32.  
  33. template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
  34.     for (const T &x: v) out << x << ' ';
  35.     return out;
  36. }
  37.  
  38. void AhMeD_HoSSaM(){
  39.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  40.     // #ifndef ONLINE_JUDGE
  41.     //     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  42.     // #endif
  43. }
  44.  
  45. ll BS(vector < ll >& w, ll H){
  46.     auto is_good = [&](ll m){
  47.         ll h = 0;
  48.         for(auto& i : w) h += ceil(i, m);
  49.         return h <= H;
  50.     };
  51.     ll l = 1, r = 1, ans = -1;
  52.     while(!is_good(r)) r *= 2;
  53.     while(l <= r){
  54.         ll m = l + (r - l) / 2;
  55.         (is_good(m) ? r = m - 1, ans = m : l = m + 1);
  56.     }
  57.     return ans;
  58. }
  59.  
  60. void Solve(){
  61.     int n, H;
  62.     cin >> n >> H;
  63.     vector < ll > w(n);
  64.     cin >> w;
  65.     cout << BS(w, H) << "\n";
  66. }
  67.  
  68. int main(){
  69.     AhMeD_HoSSaM();
  70.     int t = 1;
  71.     //cin >> t;
  72.     while(t--)
  73.         Solve();
  74.     return 0;
  75. }
RAW Paste Data Copied