Submission #654756

#TimeUsernameProblemLanguageResultExecution timeMemory
654756gun_ganSelf Study (JOI22_ho_t2)C++17
100 / 100
347 ms10880 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { cin.tie(0); ios_base::sync_with_stdio(0); ll n, m; cin >> n >> m; vector<ll> a(n), b(n); for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n; i++) cin >> b[i]; for(int i = 0; i < n; i++) a[i] = max(a[i], b[i]); auto ok = [&](ll x) -> bool { ll left = n * m; for(int i = 0; i < n; i++) { left -= min(m, (x + a[i] - 1) / a[i]); if(x - a[i] * m > 0) left -= (x - a[i] * m + b[i] - 1) / b[i]; if(left < 0) return 0; } return 1; }; ll l = 0, r = 2e18, ans = 0; while(l <= r) { ll mid = (l + r) / 2; if(ok(mid)) { l = mid + 1, ans = mid; } else { r = mid - 1; } } cout << ans << '\n'; }
#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...