Submission #743734

#	Time	Username	Problem	Language	Result	Execution time	Memory
743734		MODDI	Self Study (JOI22_ho_t2)	C++14	100 / 100	443 ms	13740 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n;
ll m;
vl a, b;
bool check(ll atleast){
	ll use = 0;
	vl cur(n);
	for(int i = 0; i < n; i++){
		cur[i] = atleast;
		if(a[i] <= b[i]){
			use += m;
			continue;
		}
		ll here = min(m, (atleast-1) / a[i] + 1);
		use += m - here;
		cur[i] = max(0LL, atleast - here * a[i]);
	}
	for(int i = 0; i < n; i++){
		if(cur[i] == 0)	continue;
		ll here = (cur[i]-1)/b[i] + 1;
		use -= here;
		if(use < 0)	return false;
	}
	
	return use>=0;

}
int main(){
	cin>>n>>m;
	a.resize(n);
	b.resize(n);
	for(int i = 0; i < n; i++)	cin>>a[i];
	for(int i = 0; i < n; i++)	cin>>b[i];
	
	ll l = 0, r = 1e18, ans;
	while(l <= r){
		ll mid = l + (r - l) / 2;
		bool can = check(mid);
		if(can){
			ans = mid;
			l = mid + 1;
		}
		else
			r = mid - 1;
	}
	cout<<ans<<endl;
	return 0;
}

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