제출 #1311073

#제출 시각아이디문제언어결과실행 시간메모리
1311073wangzhiyi33Self Study (JOI22_ho_t2)C++20
0 / 100
113 ms5196 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#pragma GCC optimize("O3,unroll-loops")
#define fir first
#define sec second
#define pb push_back

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m; cin>>n>>m;
    int a[n+1],b[n+1];
    for(int q=1;q<=n;q++)cin>>a[q];
    for(int q=1;q<=n;q++)cin>>b[q];

    int l=1,r=1e15;
    int ans=0;

    while(l<=r){
        int mid=(l+r)/2;
        int tot=0;
        for(int q=1;q<=n;q++){
            if(a[q]<=b[q]){
                tot+=(mid+b[q]-1)/b[q];
            }
            else{
                int sisa=mid-m*a[q];
                if(sisa>=0){
                    tot+=(m+ (sisa+b[q]-1)/b[q]);
                }
                else{
                    tot+=(mid+a[q]-1)/a[q];
                }
            }
        }

        if(tot<=n*m){
            ans=mid; l=mid+1;
        }
        else{
            r=mid-1;
        }
    }
    cout<<ans<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...