Submission #1239157

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239157		ebrambill	Self Study (JOI22_ho_t2)	C++20	0 / 100	1095 ms	5112 KiB

Main

//In the name of GOD

#include <bits/stdc++.h>
using namespace std;

const long long maxN=3e5+5;
long long n, m, a[maxN], b[maxN];

bool can(long long x){
	long long cnt=0;
	for (long long i=1; i<=n; i++){
		if(a[i]<b[i]) cnt+=(x+b[i]-1)/b[i];
		else{
			long long A=min((x+a[i]-1)/a[i], m), B=(max(0LL, x-A*a[i])+b[i]-1)/b[i];
			cnt+=A+B;
		}
		if(cnt>n*m) return false;
	}
	return true;
}

int main(){
	cin >>n >>m;
	for (long long i=1; i<=n; i++) cin >>a[i];
	for (long long i=1; i<=n; i++) cin >>b[i];

	long long l=0, r=LLONG_MAX;
	while(r-l>1){
		long long mid=(r>>1)+(l>>1);
		if(can(mid)) l=mid;
		else r=mid;
	}
	cout <<l;
}

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