Submission #937868

#TimeUsernameProblemLanguageResultExecution timeMemory
937868LitusianoSelf Study (JOI22_ho_t2)C++17
0 / 100
436 ms7468 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define endl "\n" vector<pair<int,int>> v; int n,m; bool check(int mid){ vector<int> need(n); int left = 0; for(int i = 0; i<n; i++){ int z = max(v[i].first, v[i].second); int k = (mid+z-1)/z; need[i] = max(0ll,mid-(m * z)); left+=max(0ll,m-k); } for(int i = 0; i<n; i++){ if(need[i] <= 0) continue; left -= (need[i] + v[i].second - 1)/v[i].second; } return left>=0; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>m; v.resize(n); for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second; int ans = LLONG_MAX; for(auto i : v){ ans = min(ans,max(i.first,i.second)); } int l = 0; int r = 2e18; while(r > l+1){ int mid = (l+r)/2; if(check(mid)) l = mid; else r = mid; } cout<<l<<endl; }
#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...