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 ll long long
const int nx=3e5+5;
ll n, m, a[nx], b[nx], l=1, r=1e18, c;
bool check(ll x)
{
ll vl=n*m;
for (int i=1; i<=n; i++)
{
if (b[i]>=a[i]) c=(x%b[i]==0)?(x/b[i]):(x/b[i]+1);
else
{
if (a[i]*m>=x) c=(x%a[i]==0)?(x/a[i]):(x/a[i]+1);
else
{
ll tmp=x-a[i]*m;
c=m+((tmp%b[i]==0)?(tmp/b[i]):(tmp/b[i]+1));
}
}
if (vl<c) return 0;
vl-=c;
}
return 1;
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=n; i++) cin>>a[i];
for (int i=1; i<=n; i++) cin>>b[i];
while (l<r)
{
ll md=(l+r+1)/2;
if (check(md)) l=md;
else r=md-1;
}
cout<<l;
}
# | 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... |