Submission #170328

#	Time	Username	Problem	Language	Result	Execution time	Memory
170328		ngmh	Cipele (COCI18_cipele)	C++11	90 / 90	52 ms	3760 KiB

cipele

#include <bits/stdc++.h>
using namespace std;

long long n, m, mini, maxi = 1000000010, medi, l[100000], r[100000];

bool can(long long u){
	long long c = 0, p = 0;
	if(n == m){
		for(int i = 0; i < n; i++){
			if(abs(l[i]-r[i]) > u) return false;
		}
		return true;
	} else if(n < m){
		for(int i = 0; i < m; i++){
			if(abs(l[c]-r[i]) <= u){
				c++;
				p++;
				if(c == n) break;
			}	
		}
		if(p == n) return true;
		return false;
	} else {
		for(int i = 0; i < n; i++){
			if(abs(r[c]-l[i]) <= u){
				c++;
				p++;
				if(c == m) break;
			}
		}
		if(p == m) return true;
		return false;
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for(int i = 0; i < n; i++) cin >> l[i];
	for(int i = 0; i < m; i++) cin >> r[i];
	sort(l, l+n);
	sort(r, r+m);
	while(mini < maxi){
    medi = mini+(maxi-mini)/2;
    if(can(medi)) maxi = medi;
    else mini = medi+1;
}
	cout << mini;
}

• 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