Submission #1018810

#TimeUsernameProblemLanguageResultExecution timeMemory
1018810vjudge1Self Study (JOI22_ho_t2)C++17
0 / 100
119 ms5392 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define tobit(n) bitset<20>(n) //выводит 20 элементов в битовую систему #define all(v) (v).begin(), (v).end() #define rtt(v, k) rotate(v.begin(), v.begin() + k, v.end()); //move k elements back signed main(){ int n, m; cin >> n >> m; vector<int> a(n), b(n); for(auto &to : a) cin >> to; for(auto &to : b) cin >> to; int l = 0, r = 1e18 + 6; auto check = [&](int p){ int t = 0; for(int i = 0; i < n; i++){ if(b[i] > a[i]){ int b_ = (p + b[i] - 1) / b[i]; t += b_; } else { if(a[i] * m >= p){ int a_ = (p + a[i] - 1) / a[i]; t += a_; } else { int a_ = m; int b_ = (p - a[i] * a_ + b[i] - 1) / b[i]; t += a_ + b_; } } } return t <= n * m; }; while(r > l + 1){ int m = (l + r) / 2; if(check(m)) l = m; else r = m; } if(check(r)) cout << r; else cout << l; } // NEED TO FAST CIN && COUT // const int fastIO = [](){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); return 0; }();
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...