제출 #538655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538655		Benmath	Self Study (JOI22_ho_t2)	C++14	0 / 100	441 ms	4964 KiB

Main

#include<bits/stdc++.h>
using namespace std;
int main(){
 
long long int n;
long long int m;
cin>>n>>m;
long long int a[n];
long long int b[n];
for(int i=0;i<n;i++){
   cin>>a[i];
}
for(int i=0;i<n;i++){
   
   cin>>b[i];

}
for(int i=0;i<n;i++){
   a[i]=max(a[i],b[i]);
}
long long int l=1;
long long int r=1e18;
long long int ans=0;

while(l<=r){
   long long int mid=l+(r-l)/2;

   long long int brojac=0;
   for(int i=0;i<n;i++){
      long long int ro=m*a[i];
      if(ro>=mid){
         brojac=brojac+mid/a[i];
         if(mid%a[i]!=0){
            brojac++;
         }
      }else{
         brojac=brojac+m;
         long long int mid1=mid-ro;
        
         
         brojac=brojac+mid1/b[i];
         
         if(mid1%b[i]!=0){
            brojac++;
         }
         
      }
   }
   if(brojac<=(n*m)){
      ans=max(ans,mid);
      l=mid+1;
   }else{
      r=mid-1;
   }
}

cout<<ans<<endl;
}

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