# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598790 | denniskim | Self Study (JOI22_ho_t2) | C++17 | 254 ms | 11436 KiB |
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;
typedef __int128 lll;
typedef long double ld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
ll n;
ll m;
ll a[300010], b[300010];
ll l, r;
int main(void)
{
scanf("%lld %lld", &n, &m);
for(ll i = 1 ; i <= n ; i++)
scanf("%lld", &a[i]);
for(ll i = 1 ; i <= n ; i++)
scanf("%lld", &b[i]);
l = 0;
r = 1000000000000000001;
while(l + 1 < r)
{
ll mid = (l + r) / 2;
ll cou = 0;
for(ll i = 1 ; i <= n ; i++)
{
if(a[i] < b[i])
cou += (mid + b[i] - 1) / b[i];
else
{
if((mid + a[i] - 1) / a[i] <= m)
cou += (mid + a[i] - 1) / a[i];
else
{
cou += m;
cou += (mid - a[i] * m + b[i] - 1) / b[i];
}
}
if(cou > n * m)
break;
}
if(cou > n * m)
r = mid;
else
l = mid;
}
printf("%lld", l);
return 0;
}
Compilation message (stderr)
# | 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... |