Submission #536771

#	Time	Username	Problem	Language	Result	Execution time	Memory
536771		neon_paradox	Self Study (JOI22_ho_t2)	C++14	62 / 100	296 ms	14444 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
	ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
	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);
		if(y[i] > x[i]) x[i] = max(y[i],x[i]);
	}
	int l=0;
	int r=9999999999999999;
	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(((long double)mid-m*x[i])/y[i]);
			}
			else{
				c-=ceil((long double)mid/x[i]);
				c+=m;
			}
			
		}
		
		if (c<0)r=mid;
		else l=mid;
	}
	cout << l << "\n";
}

		

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