제출 #536801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536801		xp875	Self Study (JOI22_ho_t2)	C++17	100 / 100	244 ms	5068 KiB

Main

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

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); 
	
	ll n, m;
	cin >> n >> m;
	ll a[n], b[n];
	for(int i=0; i<n; i++) cin >> a[i];
	for(int i=0; i<n; i++) cin >> b[i];
	
	ll lo = 0, hi = (ll)1<<60;
	while(hi-lo>1) {
		ll x = (lo+hi)/2;
		ll ans = 0;
		for(int i=0; i<n; i++) {
			if(b[i]>=a[i]) {
				ans += (x+b[i]-1)/b[i];
			}
			else {
				if(x>m*a[i]) ans += m + (x-a[i]*m+b[i]-1)/b[i];
				else ans += (x+a[i]-1)/a[i];
			}
			if(ans > n*m) {
				hi = x;
				break;
			}
		}
		if(ans<=n*m)	lo = x;
	}
	cout << lo;
}

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