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;
typedef long long ll;
int main()
{
ll n1,m1;
cin>>n1>>m1;
__int128_t n=n1,m=m1;
__int128_t cad[3][n];
for(int j=0; j<n; j++)
{
ll temp;
cin>>temp;
cad[0][j]=temp;
}
for(int j=0; j<n; j++)
{
ll temp;
cin>>temp;
cad[1][j]=temp;
cad[0][j]=max(cad[1][j],cad[0][j]);
cad[2][j]=cad[0][j]*m;
}
__int128_t a=0,b=5e20;
while(a-b!=1&&a-b!=-1)
{
__int128_t m=(a+b)/2;
__int128_t op=0;
for(int i=0; i<n; i++)
{
if(cad[2][i]>m)
op+=(cad[2][i]-m)/cad[0][i];
}
for(int i=0; i<n; i++)
{
if(cad[2][i]<m)
{
op-=(m-cad[2][i]+cad[1][i]-1)/cad[1][i];
}
}
if(op>=0)
a=m;
else b=m;
}
cout<<(ll)b-1;
}
# | 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... |