Submission #1125339

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
typedef pair<int,pint> tint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
ostream &operator<<(ostream &os, const vector<int> &a) {
	os<<"[";
	rep(i,a.size()){
		os<<a[i];
		if(i<a.size()-1) os<<",";
	}
	os<<"]";
	return os; 
}
#define N 32768
#define maxv 114514
vector<pint> v,v2;
vector<tint> t;
vector<int> gr[maxv],rgr[maxv];
vector<int> vs;
bool sumi[maxv];
int cmp[maxv];
vector<int> pos[25252];
int n;
void dfs(int v){
	sumi[v]=true;
	rep(i,gr[v].size()){
		if(!sumi[gr[v][i]]) dfs(gr[v][i]);
	}
	vs.pb(v);
}
void rdfs(int v,int k){
	sumi[v]=true;cmp[v]=k;
	rep(i,rgr[v].size()){
		if(!sumi[rgr[v][i]]) rdfs(rgr[v][i],k);
	}
}
void scc()
{
	memset(sumi,false,sizeof(sumi));
	vs.clear();
	rep(i,n*2){
		if(!sumi[i]) dfs(i);
	}
	memset(sumi,false,sizeof(sumi));
	//memset(cmp,-1,sizeof(cmp));
	int k=0;
	for(int i=vs.size()-1;i>=0;i--){
		if(!sumi[vs[i]]) rdfs(vs[i],k++);
	}
}
void aedge(int v,int w){
	gr[v].pb(w);
	rgr[w].pb(v);
}
//[a,b)にvから辺を貼る
void query(int a,int b,int v,int k=0,int l=0,int r=N){
	//REP(i,a,b) aedge(v,i+2*n+N-1);return;
	if(r<=a || b<=l) return;
	if(a<=l && r<=b){
		//cout<<k<<endl;
		aedge(v,k+2*n);return;
	}
	query(a,b,v,k*2+1,l,(l+r)/2);
	query(a,b,v,k*2+2,(l+r)/2,r);
}
bool cal(int mi){
	rep(i,maxv-5) gr[i].clear(),rgr[i].clear();
	rep(i,N-1) aedge(2*n+i,2*n+i*2+1),aedge(2*n+i,2*n+i*2+2);
	rep(i,n){
		aedge(pos[i][0],pos[i][1]+2*n+N-1);
		aedge(pos[i][1]+2*n+N-1,pos[i][0]);
		aedge(pos[i][1],pos[i][0]+2*n+N-1);
		aedge(pos[i][0]+2*n+N-1,pos[i][1]);
	}
	rep(i,n*2){
		int l=lower_bound(All(v),mp(v[i].fi-mi+1,-1))-v.begin();
		int r=lower_bound(All(v),mp(v[i].fi+mi,-1))-v.begin();
		//cout<<i<<' '<<l<<' '<<r<<endl;
		//cout<<l<<'q'<<i<<endl;
		query(l,i,i);
		//cout<<i+1<<'q'<<r<<endl;
		query(i+1,r,i);
	}
	scc();
	rep(i,2*n){
		//cout<<cmp[i]<<' '<<cmp[i+2*n+N-1]<<endl;
		if(cmp[i]==cmp[i+2*n+N-1]) return false;
	}
	return true;
}
int main()
{
	int x,y,inf=1001001001;
	cin>>n;
	rep(i,n){
		cin>>x>>y;
		if(x>y) swap(x,y);
		v.pb(mp(x,i));v.pb(mp(y,i));
	}
	sort(All(v));v.pb(mp(inf*2,-1));
	rep(i,2*n) pos[v[i].se].pb(i);
	//rep(i,n) cout<<pos[i]<<endl;
	
	int lo=0,hi=inf;
	//cal(5);
	while(hi>lo){
		int mi=(hi+lo+1)/2;
		if(cal(mi)) lo=mi;else hi=mi-1;
	}
	cout<<lo<<endl;
}

Submission Info

Judge Result