Submission #1179442

#TimeUsernameProblemLanguageResultExecution timeMemory
117944212345678Self Study (JOI22_ho_t2)C++17
0 / 100
83 ms4936 KiB
#include<bits/stdc++.h> using namespace std; #define int long long signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int n,m; cin>>n>>m; int a[n],b[n]; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) cin>>b[i]; int l=0,r=1e18*3; while(l<r) { int mid=(l+r+1)/2; int cnt=0; for(int i=0;i<n;i++) { int t=mid; if(b[i]>=a[i]) { cnt+=((t%b[i])==0)?t/b[i]:(t/b[i]+1); //cnt+=ceil((double)t/b[i]); continue; } if(a[i]*m>=t) { cnt+=((t%a[i])==0)?t/a[i]:(t/a[i]+1); //cnt+=ceil((double)t/a[i]); continue; } cnt+=m; t-=a[i]*m; cnt+=((t%b[i])==0)?t/b[i]:(t/b[i]+1); if (cnt>n*m) break; } //cout<<l<<" "<<r<<" "<<mid<<endl; if(cnt<=n*m) l=mid; else r=mid-1; } 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...