제출 #995602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995602		vyshniak_n	Self Study (JOI22_ho_t2)	C++17	100 / 100	88 ms	10844 KiB

Main

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 3e5 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 20;
const ll K = 1e3 + 20;

ll n, m, a[N], b[N];

bool check(ll x) {
    ll cnt = 0;
    for (ll i = 0; i < n; i++) {
        if (max(a[i], b[i]) * m >= x) 
            cnt += (x + max(a[i], b[i]) - 1) / max(a[i], b[i]);
        else
            cnt += m + (x - max(a[i], b[i]) * m + b[i] - 1) / b[i];

        if (cnt > n * m)
            return 0;
    }
    return 1;
}

void solve() {
    cin >> n >> m;

    for (ll i = 0; i < n; i++)
        cin >> a[i];
    for (ll i = 0; i < n; i++)
        cin >> b[i];

    ll l = 0, r = 1LL << 60;
    while (l + 1 < r) {
        ll mid = (l + r) >> 1;

        if (check(mid))
            l = mid;
        else 
            r = mid;
    }

    cout << l << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

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