zcmimi's blog
查看原题

点击跳转

#include<bits/stdc++.h>
#pragma GCC optimize(3)
#define il __inline__ __attribute__ ((always_inline))
#define fur(i,x,y) for(int i(x);i<=y;++i)
template <class T>il T ABS(T x){return x>0?x:-x;}
template <class T>il T MAX(T x,T y){return x>y?x:y;}
template <class T>il T MIN(T x,T y){return x<y?x:y;}
using namespace std;
namespace IO{const int str=1<<20;static char in_buf[str],*in_s,*in_t;bool __=0;il char gc(){return (in_s==in_t)&&(in_t=(in_s=in_buf)+fread(in_buf,1,str,stdin)),in_s==in_t?EOF:*in_s++;}il void in(string &ch){ch.clear();if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)__=1;}il void in(char &ch){if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)__=1;else ch=c;}il void in(char *ch){*ch='\0';if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)__=1;*ch='\0';}template<typename T>il void in(T &x){if(__)return;char c=gc();bool f=0;while(c!=EOF&&(c<'0'||c>'9'))f^=(c=='-'),c=gc();if(c==EOF){__=1;return;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=x*10+c-48,c=gc();if(c==EOF)__=1;if(f)x=-x;}template<typename T,typename ... arr>il void in(T &x,arr & ... y){in(x),in(y...);}const char ln='\n';static char out_buf[str],*out_s=out_buf,*out_t=out_buf+str;il void flush(){fwrite(out_buf,1,out_s-out_buf,stdout);out_s=out_buf;}il void pt(char c){(out_s==out_t)?(fwrite(out_s=out_buf,1,str,stdout),*out_s++=c):(*out_s++=c);}il void out(const char* s){while(*s)pt(*s++);}il void out(char* s){while(*s)pt(*s++);}il void out(char c){pt(c);}il void out(string s){for(int i=0;s[i];i++)pt(s[i]);}template<typename T>il void out(T x){if(!x){pt('0');return;}if(x<0)pt('-'),x=-x;char a[50],t=0;while(x)a[t++]=x%10,x/= 10;while(t--)pt(a[t]+'0');}template<typename T,typename ... arr>il void out(T x,arr & ... y){out(x),out(y...);}}using namespace IO;
const int N=100011,inf=2122219134;
int n,rt,ls[N],rs[N],L[N],R[N],D[N],U[N],ans=inf;
struct node{int x,y;}t[N];
bool cmpx(node a,node b){return a.x<b.x;}
bool cmpy(node a,node b){return a.y<b.y;}
void upd(int x,int y){
    L[x]=MIN(L[x],L[y]),R[x]=MAX(R[x],R[y]),
    D[x]=MIN(D[x],D[y]),U[x]=MAX(U[x],U[y]);
}
void pu(int x){
    L[x]=R[x]=t[x].x,
    D[x]=U[x]=t[x].y;
    if(ls[x])upd(x,ls[x]);
    if(rs[x])upd(x,rs[x]);
}
int build(int l,int r){
    if(l>r)return 0;
    int m=l+r>>1;
    double ax=0,ay=0,vx=0,vy=0;
    fur(i,l,r)ax+=t[i].x,ay+=t[i].y;
    ax/=r-l+1,ay/=r-l+1;
    fur(i,l,r)
        vx+=ABS(ax-t[i].x),
        vy+=ABS(ay-t[i].y);
    nth_element(t+l,t+m,t+r+1,vx>vy?cmpx:cmpy);
    ls[m]=build(l,m-1),rs[m]=build(m+1,r),pu(m);
    return m;
}
int id,mi,mx;
int dis(int p){return ABS(t[p].x-t[id].x)+ABS(t[p].y-t[id].y);}
int fmi(int p){
    return MAX(L[p]-t[id].x,0)+MAX(t[id].x-R[p],0)+
           MAX(D[p]-t[id].y,0)+MAX(t[id].y-U[p],0);
}
int fmx(int p){
    return MAX(ABS(L[p]-t[id].x),ABS(R[p]-t[id].x))+
           MAX(ABS(D[p]-t[id].y),ABS(U[p]-t[id].y));
}
void qmi(int x){
    if(!x)return;
    if(x!=id)mi=MIN(mi,dis(x));
    int ld=fmi(ls[x]),rd=fmi(rs[x]);
    if(ld<rd){
        if(ld<mi)qmi(ls[x]);
        if(rd<mi)qmi(rs[x]);
    }
    else{
        if(rd<mi)qmi(rs[x]);
        if(ld<mi)qmi(ls[x]);
    }
}
void qmx(int x){
    if(!x)return;
    if(x!=id)mx=MAX(mx,dis(x));
    int ld=fmx(ls[x]),rd=fmx(rs[x]);
    if(ld>rd){
        if(ld>mx)qmx(ls[x]);
        if(rd>mx)qmx(rs[x]);
    }
    else{
        if(rd>mx)qmx(rs[x]);
        if(ld>mx)qmx(ls[x]);
    }
}
int main(){
    in(n);
    fur(i,1,n)in(t[i].x,t[i].y);
    rt=build(1,n);
    fur(i,1,n)
        id=i,mi=inf,mx=-inf,
        qmi(rt),qmx(rt),
        ans=MIN(ans,mx-mi);
    printf("%d\n",ans);
}
LG 2479 [SDOI2010]捉迷藏
comment评论
Search
search