제출 #1271653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1271653		Sofiatpc	Self Study (JOI22_ho_t2)	C++20	100 / 100	177 ms	5132 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize ("trapv")

#define int long long
const int MAXN = 3*1e5+5;
int a[MAXN], b[MAXN], n,m;

int teto(int x, int y){
    return (x + (y-1))/y;
}

bool test(int h){
    int tempo = 0;
    for(int i = 1; i <= n; i++){
        if(max(a[i],b[i])*m >= h)tempo += teto(h, max(a[i],b[i]) );
        else tempo += m + teto( h - max(a[i],b[i])*m, b[i]);
        if(tempo > n*m)return false;
    }  
    return true;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.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;
    while(l != r){
        int mid = (l+r+1)/2;
        if(test(mid)) l = mid;
        else r = mid-1;
    }
    cout<<l<<"\n";
}

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