Submission #978716

#TimeUsernameProblemLanguageResultExecution timeMemory
978716DobromirAngelovSelf Study (JOI22_ho_t2)C++14
0 / 100
278 ms5204 KiB
#include<bits/stdc++.h> #define endl '\n' using namespace std; const int MAXN=3e5+5; const long long INF=2e18+5; int n,m; long long a[MAXN]; long long b[MAXN]; bool ok(long long val) { long long s=0; for(int i=1;i<=n;i++) { if(a[i]*m>=val) s+=(val+a[i]-1)/a[i]; else s+=m+(val-a[i]*m+b[i]-1)/b[i]; } if(s>1LL*n*m) return 0; return 1; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); 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++) a[i]=max(a[i],b[i]); long long l=1,r=INF; while(l<r) { long long mid=(l+r+1)/2; if(ok(mid)) l=mid; else r=mid-1; } cout<<l<<endl; 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...