Submission #855718

#	Time	Username	Problem	Language	Result	Execution time	Memory
855718		vjudge1	Cipele (COCI18_cipele)	C++17	0 / 90	72 ms	2844 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define pb push_back
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define all(x) x.begin()+1,x.end()
const int N = 4e5+1;


void solve() {
	int n,m;
	cin >> n >> m;
	vi a(n+1),b(m+1);
	F(i,n) cin >> a[i];
	F(i,m) cin >> b[i];
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	if (a.size() > b.size()) swap(a,b),swap(n,m);
	int l = 0;
	int r = 1e9;
	while (l<=r) {
		int x = (l+r) >> 1;
		int ptr2 = 1;
		stack<int> s;
		int fl = 1;
		for (int i=1;i<=n;i++) {
			while (ptr2<=m && (s.empty() || s.top() < a[i]-x)) s.push(b[ptr2++]);
			if (s.top() >= a[i]-x && s.top() <= a[i]+x) continue;
			fl = 0;
			break;
		}
		if (fl) r = x-1;
		else l = x+1;
	}
	cout << l << endl;
}     	
                                
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

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