제출 #1343507

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1343507		hoangtien69	Self Study (JOI22_ho_t2)	C++20	0 / 100	95 ms	5088 KiB

Main

#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++)
    {
        int peal = max(a[i], b[i]);
        if (mid > a[i] * m)
        {
            int cur = mid;
            cur -= peal * m;
            cnt += m;
            cnt += (cur + b[i] - 1) / b[i];
        }
        else
        {
            cnt += (mid + peal - 1) / peal;
        }
    }
    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];
    }
    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;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9