제출 #536759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536759		neon_paradox	Self Study (JOI22_ho_t2)	C++14	10 / 100	380 ms	13808 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
	int n,m;
	cin>>n>>m;
	vector<int> x;
	vector<int> y;
	int p;
	for (int i = 0; i < n; i++){
		cin>>p;
		x.push_back(p);
	}
	for (int i = 0; i < n; i++){
		cin>>p;
		y.push_back(p);
		x[i]=max(x[i],y[i]);
	}
	int l=0;
	int r=9999999999999;
	int mid,c;
	while(l!=r-1){
		mid=(l+r)/2;
		c=0;
		for (int i = 0 ;i < n; i++){
			
			if(m*x[i]<mid){
				c-=ceil(((double)mid-m*x[i])/y[i]);
			}
			else{
				c-=ceil((double)mid/x[i]);
				c+=m;
			}
			
		}
		
		if (c<0)r=mid;
		else l=mid;
	}
	cout << l << "\n";
}

		
		

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