Submission #1041226

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041226		SoulKnight	Self Study (JOI22_ho_t2)	C++17	10 / 100	41 ms	11348 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ln '\n'

const int N = 3e5 + 5;
const ll INF = 5e18 + 5;

ll n, m, a[N], b[N];
inline ll ceil(ll x, ll y) {return (x + y - 1) / y;}

ll cnt(ll go_lesson, ll i, ll tar){
    return (m - go_lesson) - max(0LL, ceil(tar - a[i] * go_lesson, b[i]));
}

void solve(){
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];

    ll best = INF;
    for (int i = 0; i < n; i++) best = min(best, max(a[i], b[i]));
    cout << best << ln;

    // ll l = 7, r = 7, ans = 0;
    // ll l = 0, r = INF, ans = 0;
    // while (l <= r){
    //     ll tar = (l + r) / 2;
    //     ll diff = 0; // diff = free - need

    //     for (int i = 0; i < n; i++){
    //         diff += max(cnt(1, i, tar), cnt(0, i, tar));
    //     }
    //     if (diff >= 0) {ans = tar; l = tar + 1;}
    //     else r = tar - 1;
    // }
    // cout << ans << ln;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // int TT; cin >> TT;
    // while (TT--) {solve();}

    solve();

}

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