제출 #869977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
869977		boris_mihov	Self Study (JOI22_ho_t2)	C++17	100 / 100	205 ms	5208 KiB

Main

#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
 
typedef long long llong;
const int MAXN = 300000 + 10;
const llong INF = 1e18;
 
llong n, m;
llong a[MAXN]; 
llong b[MAXN];

bool check(llong value)
{
    llong freeB = 0;
    for (int i = 1 ; i <= n ; ++i)
    {
        llong currLections = std::min(m, (value / a[i] + ((value % a[i]) > 0)));
        if (value <= m * a[i]) freeB += m - currLections;
        else
        {
            llong moreLections = (value - m * a[i]) / b[i] + (((value - m * a[i]) % b[i]) > 0);
            freeB -= moreLections;
        }

        if (freeB + (n - i) * m < 0)
        {
            return 0;
        }
    }
 
    return freeB >= 0;
}
 
void solve()
{
    llong l = 0, r = INF + 1, mid;
    while (l < r - 1)
    {
        mid = (l + r) / 2;
        if (check(mid)) l = mid;
        else r = mid;
    }
 
    std::cout << l << '\n';
}
 
void read()
{
    std::cin >> n >> m;
    for (int i = 1 ; i <= n ; ++i) 
    {
        std::cin >> a[i];
    }
 
    for (int i = 1 ; i <= n ; ++i) 
    {
        std::cin >> b[i];
        a[i] = std::max(a[i], b[i]);
    }
}
 
void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}
 
int main()
{
    fastIO();
    read();
    solve();
 
    return 0;
}

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