# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638707 | jamezzz | Self Study (JOI22_ho_t2) | C++17 | 635 ms | 9228 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sf scanf
typedef long long ll;
typedef pair<int,int> ii;
#define maxn 300005
int n,m,a[maxn],b[maxn];
int main(){
sf("%d%d",&n,&m);
for(int i=0;i<n;++i){
sf("%d",&a[i]);
}
for(int i=0;i<n;++i){
sf("%d",&b[i]);
}
ll lo=0,hi=1e18+10,mid,res=0;
while(lo<=hi){
mid=(lo+hi)>>1;
ll rem=(ll)n*m;
for(int i=0;i<n;++i){
ll take=min((ll)m,(mid+a[i]-1)/a[i]);
ll self=max((mid-(take*a[i])+b[i]-1)/b[i],0ll);
ll self2=(mid+b[i]-1)/b[i];
rem-=min(take+self,self2);
if(rem<0)break;
}
if(rem>=0){
res=mid;
lo=mid+1;
}
else hi=mid-1;
}
pf("%lld\n",res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |