Submission #130970

#	Time	Username	Problem	Language	Result	Execution time	Memory
130970		Lightning	Cipele (COCI18_cipele)	C++14	90 / 90	53 ms	2972 KiB

cipele

#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

const int N = 2e5;
const int INF = 1e9;

int n, m, a[N], b[N];

bool check(int x) {
	int pos = 1;
	for(int i = 1; i <= n; ++i) {
		while(pos <= m && abs(a[i] - b[pos]) > x) {
			++pos;		
		}
		if(pos <= m && abs(a[i] - b[pos]) <= x) {
			++pos;
		}	
		else {
			return 0;
		}
	}
	return 1;		
}

int main () {
	ios_base :: sync_with_stdio(false);
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);	
	for(int i = 1; i <= m; ++i) {
		cin >> b[i];
	}
	sort(b + 1, b + m + 1);
	if(n > m) {
		for(int i = 1; i <= n; ++i) {
			swap(a[i], b[i]);
		}
		swap(n, m);
	}
	int l = 0, r = INF;
	while(l < r) {
		int mid = (l + r) / 2;
		if(check(mid)) r = mid;
		else l = mid + 1;
	}
	cout << r;
	return 0;
}

• 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