| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343504 | hoangtien69 | Self Study (JOI22_ho_t2) | C++20 | 94 ms | 5128 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 3e5 + 5;
int n, m;
int a[MAXN];
int b[MAXN];
bool ck(int mid)
{
int cnt = 0;
for (int i = 1; i <= n; i++)
{
if (mid > a[i] * m)
{
int cur = mid;
cur -= a[i] * m;
cnt += m;
cnt += (cur + b[i] - 1) / b[i];
}
else
{
cnt += (mid + a[i] - 1) / a[i];
}
}
return (cnt <= 1LL * m * n);
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
for (int i = 1; i <= n; i++)
{
cin >> b[i];
a[i] = max(a[i], b[i]);
}
int l = 0;
int r = 1e18;
int ans = -1;
while(l <= r)
{
int mid = (l + r) / 2;
if (ck(mid))
{
l = mid + 1;
ans = mid;
}
else
{
r = mid - 1;
}
}
cout << ans << "\n";
}
| # | 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... | ||||
