제출 #1002454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002454		THXuan	Self Study (JOI22_ho_t2)	C++14	100 / 100	149 ms	11348 KiB

Main

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define INF 2e18
using namespace std;
typedef long long ll;

ll a[300005], b[300005];

void solve()
{
	ll n, m; cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	ll lo = 0; ll hi = INF;
	while (lo < hi) {
		ll mid = (lo + hi + 1) / 2;
		ll sum = 0;
		for (int i = 1; i <= n; i++) {
			if (b[i] >= a[i]) sum += (mid - 1) / b[i] + 1;
			else if (mid <= a[i] * m) sum += (mid - 1) / a[i] + 1;
			else sum += m + (mid - a[i] * m - 1) / b[i] + 1;
			if (sum > INF) break;
		}
		if (sum > n * m)hi = mid - 1;
		else lo = mid;
	}
	cout << lo << "\n";
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;// cin>>t;
	while (t--) solve();
	return 0;
}

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