Submission #1144151

#TimeUsernameProblemLanguageResultExecution timeMemory
1144151Aryan_RainaSelf Study (JOI22_ho_t2)C++20
0 / 100
135 ms4936 KiB
#include <bits/stdc++.h> using namespace std; #define int int64_t #define ar array #define all(v) begin(v), end(v) #define allr(v) rbegin(v), rend(v) #define pb push_back const int INF = 1e10; void solve() { int n, m; cin >> n >> m; vector<int> a(n), b(n); for (int &x : a) cin >> x; for (int &x : b) cin >> x; for (int i = 0; i < n; i++) a[i] = max(a[i], b[i]); auto joke = [&](int ans) { int cnt = 0; for (int i = 0; i < n; i++) { int omk = (ans + a[i] - 1) / a[i]; if (omk > m) { omk = m + (ans - a[i]*m + b[i] - 1) / b[i]; } cnt += omk; } return cnt <= m*n; }; int l = 0, r = 3e18+1; int ans = 0; while (l < r) { int mid = l + (r-l)/2; if (joke(mid)) ans = mid, l = mid+1; else r = mid-1; } if (joke(l)) ans = l; cout << ans << '\n'; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //cin >> t; while (t--) { solve(); } }
#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...