Submission #1795357


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define next nxt

int n,k,dx[N],dy[N],px[N],py[N],x[N],y[N],next[N],p[N],h[N],ans;

struct flag{int x,y,z;}a[N];
bool cmp_x(flag a,flag b){return a.x<b.x;}
bool cmp_y(flag a,flag b){return a.y<b.y;}
bool cmp_z(flag a,flag b){return a.z<b.z;}

void add(int a,int b){
	x[++k]=a;y[k]=b;next[k]=p[x[k]];p[x[k]]=k;
	x[++k]=b^1;y[++k]=a^1;next[k]=p[x[k]];p[x[k]]=k;
}

void build(int l,int r){
	int t=(l+r)|(l<r);
	if (l==r) add(2*(n+t),2*dx[l]+1),add(2*(3*n+t),2*dy[l]);
	else {
		int mid=(l+r)/2,
			lc=(l+mid)|(l<mid),
			rc=(mid+1+r)|(mid+1<r);
		add(2*(n+t),2*(n+lc));
		add(2*(n+t),2*(n+rc));
		add(2*(3*n+t),2*(3*n+lc));
		add(2*(3*n+t),2*(3*n+rc));
		build(l,mid);build(mid+1,r);
	}
}

void insert(int k,int l,int r,int x,int y,int z){
	int t=(l+r)|(l<r);
	if (x<=l&&y>=r) add(z,2*(k+t));
	else {
		int mid=(l+r)/2;
		if (x<=mid) insert(k,l,mid,x,y,z);
		if (y>=mid+1) insert(k,mid+1,r,x,y,z);
	}
}

bool travel(int x,int c1,int c2){
	h[x]=c2;
	if (h[x]&&h[x^1]) return false;
	for (int t=p[x];t;t=next[t])
		if (h[y[t]]==c1){
			if (!travel(y[t],c1,c2))
			return false;
		}
	return true;
}

bool check(int d){
	fill(p+1,p+10*n+1,0);
	fill(h+1,h+10*n+1,0);
	k=0;build(1,n);
	for (int i=1,l=1,r=0;i<=n;i++){
		while (l<=n&&a[dx[l]].x<=a[dx[i]].x-d) l++;
		while (r<n&&a[dx[r+1]].x<a[dx[i]].x+d) r++;
		if (l>r) continue;
		if (i<l||i>r) insert(n,1,n,l,r,2*dx[i]);
		else {
			if (l<i) insert(n,1,n,l,i-1,2*dx[i]);
			if (i<r) insert(n,1,n,i+1,r,2*dx[i]);
		}
	}
	for (int i=1,l=1,r=0;i<=n;i++){
		while (l<=n&&a[dy[l]].y<=a[dx[i]].x-d) l++;
		while (r<n&&a[dy[r+1]].y<a[dx[i]].x+d) r++;
		if (l>r) continue;
		insert(3*n,1,n,l,r,2*dx[i]);
	}
	for (int i=1,l=1,r=0;i<=n;i++){
		while (l<=n&&a[dx[l]].x<=a[dy[i]].y-d) l++;
		while (r<n&&a[dx[r+1]].x<a[dy[i]].y+d) r++;
		if (l>r) continue;
		insert(n,1,n,l,r,2*dy[i]+1);
	}
	for (int i=1,l=1,r=0;i<=n;i++){
		while (l<=n&&a[dy[l]].y<=a[dy[i]].y-d) l++;
		while (r<n&&a[dy[r+1]].y<a[dy[i]].y+d) r++;
		if (l>r) continue;
		if (i<l||i>r) insert(3*n,1,n,l,r,2*dy[i]+1);
		else {
			if (l<i) insert(3*n,1,n,l,i-1,2*dy[i]+1);
			if (i<r) insert(3*n,1,n,i+1,r,2*dy[i]+1);
		}
	}
	for (int i=1;i<=5*n;i++)
		if (!h[2*i]&&!h[2*i+1]){
			if (travel(2*i,0,2)) {travel(2*i,2,1);continue;}
			travel(2*i,2,0);
			if (travel(2*i+1,0,2)) {travel(2*i+1,2,1);continue;};
			return false;
		}
	return true;
}

int read(){
	int x=0,f=1;char ch=getchar();
	for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
	for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
	return x*f;
}
 
int main(){
	n=read();
	for (int i=1;i<=n;i++){
		a[i].x=read();
		a[i].y=read();
		a[i].z=i;
	}
	sort(a+1,a+n+1,cmp_x);
	for (int i=1;i<=n;i++)
		dx[i]=a[i].z,px[a[i].z]=i;
	sort(a+1,a+n+1,cmp_y);
	for (int i=1;i<=n;i++)
		dy[i]=a[i].z,py[a[i].z]=i;
	sort(a+1,a+n+1,cmp_z);
	//check(1e9);return 0;
	for (int k=1<<29;k;k/=2)
		if (check(ans+k)) ans+=k;
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Flags
User Kuugo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3079 Byte
Status WA
Exec Time 5255 ms
Memory 33152 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1200
Status
AC × 3
AC × 17
WA × 5
TLE × 8
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 5 ms 18688 KB
00_example_02.txt AC 5 ms 18688 KB
00_example_03.txt AC 5 ms 18688 KB
01.txt AC 10 ms 18688 KB
02.txt AC 7 ms 18688 KB
03.txt AC 5 ms 18688 KB
04.txt AC 6 ms 18688 KB
05.txt AC 6 ms 18688 KB
06.txt WA 206 ms 31104 KB
07.txt WA 209 ms 33152 KB
08.txt WA 206 ms 33152 KB
09.txt AC 10 ms 18688 KB
10.txt AC 7 ms 18688 KB
11.txt AC 5 ms 18688 KB
12.txt AC 5 ms 18688 KB
13.txt AC 6 ms 18688 KB
14.txt TLE 5255 ms 31104 KB
15.txt TLE 5255 ms 31104 KB
16.txt TLE 5255 ms 31104 KB
17.txt AC 17 ms 18688 KB
18.txt AC 8 ms 18688 KB
19.txt WA 640 ms 33152 KB
20.txt WA 258 ms 31104 KB
21.txt TLE 5255 ms 31104 KB
22.txt AC 285 ms 31104 KB
23.txt TLE 5255 ms 31104 KB
24.txt TLE 5255 ms 31104 KB
25.txt TLE 5255 ms 31104 KB
26.txt TLE 5255 ms 31104 KB
27.txt AC 5 ms 18688 KB