Submission #995669

#TimeUsernameProblemLanguageResultExecution timeMemory
995669mnieplowiczSelf Study (JOI22_ho_t2)C++14
0 / 100
85 ms9700 KiB
#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); long long n, m; cin >> n >> m; vector<long long> a(n); for(auto &x : a) cin >> x; vector<long long> b(n); for(auto &x : b) cin >> x; for(int i = 0; i < n; i++) a[i] = max(a[i], b[i]); auto check = [&](long long val){ long long l = 0; for(int i = 0; i < n; i++){ if(a[i]*m >= val) l += ((val - 1)/a[i] + 1); else l += (m + (val - m*a[i] -1)/b[i] + 1); } if(l <= m*n) return true; else return false; }; long long l = 0, r = 1e18; while(l+1 != r){ long long mid = (l+r)/2; if(check(mid)) l = mid; else r = mid; } cout << l << '\n'; 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...