제출 #1166730

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166730		MunkhturErdenebat	Self Study (JOI22_ho_t2)	C++20	100 / 100	219 ms	36440 KiB

Main

#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <iterator>
#include <set>
#include <stdlib.h>
 #define ll long long
 #define fr first
 #define sc second
 #define pb push_back
using namespace std;
    ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q[3000005],t[5000005],k[5000005];
    map<ll,ll> mee,see;
    map<ll,ll> maa,mii;
    vector<ll> vas[1000006],ves[200005],vis,vii;
    string x[100000],y,z;
    pair<ll,ll> wefe;
    priority_queue<ll> pq;
    stack<ll> munkh;
int main(){
    cin>>a>>b;
    for(i=0 ; i<a ; i++){
        cin>>k[i];
    }
    for(i=0 ; i<a ; i++){
        cin>>q[i];
        k[i]=max(k[i],q[i]);
    }
    l=0;
    r=1e18;
    while(l<r){
        m=(l+r+1)/2;
        g=0;
        vector<ll>d(n);
        for(i=0 ; i<a ; i++){
            if((m+k[i]-1)/k[i]<=b){
                g+=b-(m+k[i]-1)/k[i];
            }
            else{
                c=m-b*k[i];
                g-=(c+q[i]-1)/(q[i]);
            }
            if(g+a*b<0){
              g=-1e18;
              break;
            }
        }
        if(g>=0){
            l=m;
        }
        else{
            r=m-1;
        }
    }
    cout<<l;
}

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