제출 #1286643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1286643		kaiboy	Self Study (JOI22_ho_t2)	C++20	100 / 100	138 ms	2788 KiB

Main

#include <algorithm>
#include <iostream>

using namespace std;

const       int   N = 300000;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;

int aa[N], bb[N];

int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	int n, m; cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> aa[i];
	for (int i = 0; i < n; i++)
		cin >> bb[i];
	long long lower = 0, upper = INF;
	while (upper - lower > 1) {
		long long x = lower + upper >> 1;
		long long d = 0;
		for (int i = 0; i < n; i++) {
			int a = aa[i], b = bb[i], c = max(a, b);
			long long k = (x + c - 1) / c;
			if (k <= m)
				d += m - k;
			else
				d -= (x - (long long) c * m + b - 1) / b;
			if (d < -INF)
				break;
		}
		if (d >= 0)
			lower = x;
		else
			upper = x;
	}
	cout << lower << '\n';
	return 0;
}

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