| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343505 | hoangtien69 | Self Study (JOI22_ho_t2) | C++20 | 47 ms | 2748 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)
{
cnt += m;
int need = mid - a[i] * m;
cnt += (need + b[i] - 1) / b[i];
}
else
{
cnt += (mid + a[i] - 1) / a[i];
}
}
return cnt <= n * m;
}
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];
int l = 0, r = 1e18, ans = -1;
while (l <= r)
{
int mid = (l + r) / 2;
if (ck(mid))
{
ans = mid;
l = mid + 1;
}
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... | ||||
