Description
了解奶牛们的人都知道,奶牛喜欢成群结队.观察约翰的N(1≤N≤100000)只奶牛,你会
发现她们已经结成了几个“群”.每只奶牛在吃草的时候有一个独一无二的位置坐标Xi,Yi(l≤Xi,Yi≤[1..10^9];Xi,Yi∈整数.当满足下列两个条件之一,两只奶牛i和j是属于同一个群的:
1.两只奶牛的曼哈顿距离不超过C(1≤C≤10^9),即lXi - xil+IYi - Yil≤C.
2.两只奶牛有共同的邻居.即,存在一只奶牛k,使i与k,j与k均同属一个群.
给出奶牛们的位置,请计算草原上有多少个牛群,以及最大的牛群里有多少奶牛
Input
第1行输入N和C,之后N行每行输入一只奶牛的坐标.
Output
仅一行,先输出牛群数,再输出最大牛群里的牛数,用空格隔开.
Sample Input
4 2
1 1
3 3
2 2
10 10
* Line 1: A single line with a two space-separated integers: the
number of cow neighborhoods and the size of the largest cow
neighborhood.
1 1
3 3
2 2
10 10
* Line 1: A single line with a two space-separated integers: the
number of cow neighborhoods and the size of the largest cow
neighborhood.
Sample Output
2 3
OUTPUT DETAILS:
There are 2 neighborhoods, one formed by the first three cows and
the other being the last cow. The largest neighborhood therefore
has size 3.
OUTPUT DETAILS:
There are 2 neighborhoods, one formed by the first three cows and
the other being the last cow. The largest neighborhood therefore
has size 3.
题解:首先旋转坐标系,将曼哈顿距离转化成切比雪夫距离.
即x=x+y,y=x-y;
按x排序,用一个队列维护x的大小,保证队列里的x都符合要求.
加入一个数查询这个数y坐标当前的前驱和后继.
如果符合要求就用并查集连起来.查询可以用平衡树也可以用线段树.
最后统计一下最大个数即可.
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define N 100010
#define inf 10000000000
using namespace std;
int n,c,fa[N],l,r,sz,root,ls[N],rs[N],ans,num,sum[N];
struct use{int x,y,id;}p[N],q[N],mx,mn;
struct treap{use v;int s,rd;}tr[N];
int read(){
int x(0);
char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x;
}
bool operator<(use a,use b){
if (a.y==b.y) return a.id<b.id;
else return a.y<b.y;
}
bool operator==(use a,use b){
return a.y==b.y&&a.id==b.id;
}
bool cmp(use a,use b){return a.x<b.x;}
void update(int k){
tr[k].s=tr[ls[k]].s+tr[rs[k]].s+1;
}
void lturn(int &k){
int t=rs[k];rs[k]=ls[rs[k]];ls[t]=k;
update(k);update(t);k=t;
}
void rturn(int &k){
int t=ls[k];ls[k]=rs[ls[k]];rs[t]=k;
update(k);update(t);k=t;
}
void insert(int &k,use v){
if (!k){k=++sz;tr[k].v=v;tr[k].s=1;tr[k].rd=rand();return;}
if (v<tr[k].v){insert(ls[k],v);if (tr[ls[k]].rd<tr[k].rd) rturn(k);}
else {insert(rs[k],v);if (tr[rs[k]].rd<tr[k].rd) lturn(k);}
update(k);
}
void del(int &k,use v){
if (!k) return;
if (tr[k].v==v){
if (ls[k]*rs[k]==0) k=ls[k]+rs[k];
else if (tr[ls[k]].rd<tr[k].rd){rturn(k);del(k,v);}
else{lturn(k);del(k,v);}
}
else if (v<tr[k].v) del(ls[k],v);
else del(rs[k],v);
update(k);
}
void pre(int k,use v){
if (!k) return;
if (tr[k].v<v){
if (mx<(tr[k].v)) mx=tr[k].v;
pre(rs[k],v);
}
else pre(ls[k],v);
}
void after(int k,use v){
if (!k) return;
if (v<tr[k].v){
if (tr[k].v<mn) mn=tr[k].v;
after(ls[k],v);
}
else after(rs[k],v);
}
int find(int x){
if (x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
void merge(int x,int y){
int r1=find(x),r2=find(y);
if (r1!=r2){
ans--;fa[r1]=r2;
}
}
int main(){
n=read();c=read();ans=n;
for(int i=1;i<=n;i++) fa[i]=i;
for (int i=1;i<=n;i++){
p[i].x=read();p[i].y=read();
int x=p[i].x+p[i].y;int y=p[i].x-p[i].y;
p[i].x=x;p[i].y=y;
}
for (int i=1;i<=n;i++) fa[i]=i;
sort(p+1,p+n+1,cmp);l=r=1;
for (int i=1;i<=n;i++) p[i].id=i;
for (int i=1;i<=n;i++){
while (l<=r&&(p[i].x-q[l].x>c)){del(root,q[l]);l++;}
mx.y=mx.id=-inf;pre(root,p[i]);
mn.y=mn.id=inf;after(root,p[i]);
if (p[i].y-mx.y<=c) merge(p[i].id,mx.id);
if (mn.y-p[i].y<=c) merge(p[i].id,mn.id);
q[++r]=p[i];insert(root,p[i]);
}
for (int i=1;i<=n;i++) sum[find(i)]++;
for (int i=1;i<=n;i++) num=max(num,sum[i]);
printf("%d %d\n",ans,num);
}