제출 #756578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
756578		pcc	Cipele (COCI18_cipele)	C++14	90 / 90	66 ms	3456 KiB

cipele

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

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second

const int mxn = 1e5+10;
int a[mxn],b[mxn];
int n,m;

bool f(ll k){
	deque<int> dq;
	for(int i = 0;i<m;i++)dq.push_back(b[i]);
	for(int i = 0;i<n;i++){
		while(!dq.empty()&&a[i]-dq.front()>k)dq.pop_front();
		if(dq.empty())return false;
		if(abs(a[i]-dq.front())>k)return false;
		dq.pop_front();
	}
	return true;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i = 0;i<n;i++){
		cin>>a[i];
	}
	for(int i = 0;i<m;i++)cin>>b[i];
	if(n>m){
		swap(a,b);
		swap(n,m);
	}
	sort(a,a+n);
	sort(b,b+m);
	int l = 0,r = 1e9+10;
	while(l != r){
		int mid = (l+r)>>1;
		if(f(mid))r = mid;
		else l = mid+1;
	}
	cout<<l;
}

• 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