제출 #707078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707078		TAhmed33	Cipele (COCI18_cipele)	C++98	90 / 90	127 ms	3648 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m;
int arr[100001] = {};
int arr2[100001] = {};
bool check (int x) {
	int pos = 1;
	for (int i = 1; i <= n; i++) {
		int q = lower_bound(arr2 + pos, arr2 + m + 1, arr[i] - x) - arr2;
		if (q == m + 1) return false;

		if (abs(arr2[q] - arr[i]) > x) return false;
		pos = q + 1;
	}
	return true;
}
signed main () {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
	}
	for (int j = 1; j <= m; j++) {
		cin >> arr2[j];
	}
	sort(arr + 1, arr + n + 1);
	sort(arr2 + 1, arr2 + m + 1);
	if (n > m) {
		swap(n, m);
		for (int i = 1; i <= 100000; i++) swap(arr[i], arr2[i]);
	}
	int l = 0, r = 1e9;
	int mid, ans = 2;
	while (l <= r) {
		mid = (l + r) >> 1;
		if (check(mid)) {
			r = mid - 1;
			ans = mid;
		} else {
			l = mid + 1;
		}
	}
	cout << ans << '\n';
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9