Submission #1166893

#TimeUsernameProblemLanguageResultExecution timeMemory
1166893NewtonabcSelf Study (JOI22_ho_t2)C++20
100 / 100
137 ms5428 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; const int N=3e5+10; ll a[N],b[N]; bool op[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); ll n,m; cin>>n >>m; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++) cin>>b[i]; for(int i=1;i<=n;i++) op[i]=a[i]>b[i]; ll l=0,r=1e18; while(l<r){ ll mid=(l+r+1LL)/2LL; ll left=m*n; for(int i=1;i<=n;i++){ ll tmp=mid; if(op[i]){ ll att=(tmp+a[i]-1LL)/a[i]; ll can=min(att,m); left-=can; tmp-=a[i]*can; } if(tmp>0LL){ ll att=(tmp+b[i]-1LL)/b[i]; left-=att; } if(left<0LL) break; } if(left<0LL) r=mid-1LL; else l=mid; } cout<<l; }
#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...