Submission #1174811

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174811		Tsagana	Self Study (JOI22_ho_t2)	C++17	0 / 100	88 ms	4936 KiB

Main

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

int n, k;
int a[300010];
int b[300010];

bool check(int m, int s = 0) {
	for (int i = 1; i <= n; i++) {
		if (a[i] * k >= m) s += (m + a[i] - 1) / a[i];
		else s += k + (m - a[i] * k + b[i] - 1) / b[i];
	}
	return s <= n * k;
}

int search(int l, int r, int ans = 0) {
	while (l <= r) {
		int m = (l + r) / 2;
		if (check(m)) {ans = m; l = m + 1;}
		else r = m - 1;
	}
	return ans;
}

void solve () {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	for (int i = 1; i <= n; i++) a[i] = max(a[i], b[i]);
	cout << search(0, 2e18) << '\n';
}
signed main() {IOS solve(); return 0;}

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