当前位置：首页 > news >正文

诡异代码

news 2026/5/12 0:38:03

#include<bits/stdc++.h>
using namespace std;
namespace kong{bool st;}
namespace zhu{
int n,rt,ans1,ans2;
struct Murasame{int v[2];
}a[200200];
struct{int cnt=0;struct{int ls,rs,v[2],mn[2],mx[2];}tr[200200];#define mid ((l+r)>>1)#define ls(x) tr[x].ls#define rs(x) tr[x].rs#define v(x,p) tr[x].v[p]#define mn(x,p) tr[x].mn[p]#define mx(x,p) tr[x].mx[p]void up(int id){
//		cout<<"up "<<id<<endl;for(int i=0;i<2;i++){mn(id,i)=mx(id,i)=v(id,i);if(ls(id)){mn(id,i)=min(mn(id,i),mn(ls(id),i));mx(id,i)=max(mx(id,i),mx(ls(id),i));}if(rs(id)){mn(id,i)=min(mn(id,i),mn(rs(id),i));mx(id,i)=max(mx(id,i),mx(rs(id),i));}}}void build(int &id,int l,int r,int fl){if(l>r){id=0;return;}nth_element(a+l,a+mid,a+1+r,[fl](Murasame x,Murasame y){return x.v[fl]<y.v[fl];});id=++cnt;v(id,0)=a[mid].v[0],v(id,1)=a[mid].v[1];build(ls(id),l,mid-1,fl^1);build(rs(id),mid+1,r,fl^1);up(id);}int dis(int x1,int y1,int x2,int y2){return abs(x1-x2)+abs(y1-y2);}int fmin(int id,int x,int y){int ans=0;if(x<mn(id,0)) ans+=mn(id,0)-x;if(x>mx(id,0)) ans+=x-mx(id,0);if(y<mn(id,1)) ans+=mn(id,1)-y;if(y>mx(id,1)) ans+=y-mx(id,1);return ans;}int fmax(int id,int x,int y){int ans=0;ans+=max(abs(x-mn(id,0)),abs(x-mx(id,0)));ans+=max(abs(y-mx(id,1)),abs(y-mn(id,1)));return ans;}void qmin(int id,int x,int y){if(!id) return;int vl=2e9,vr=2e9;if(x!=v(id,0)||y!=v(id,1)) ans1=min(ans1,dis(x,y,v(id,0),v(id,1)));if(ls(id)) vl=fmin(ls(id),x,y);if(rs(id)) vr=fmin(rs(id),x,y);if(vl<vr){if(vl<ans1) qmin(ls(id),x,y);if(vr<ans1) qmin(rs(id),x,y);} else{if(vr<ans1) qmin(rs(id),x,y);if(vl<ans1) qmin(ls(id),x,y);}}void qmax(int id,int x,int y){if(!id) return;int vl=-2e9,vr=-2e9;if(x!=v(id,0)||y!=v(id,1)) ans2=max(ans1,dis(x,y,v(id,0),v(id,1)));if(ls(id)) vl=fmax(ls(id),x,y);if(rs(id)) vr=fmax(rs(id),x,y);if(vl<vr){if(vl>ans2) qmax(ls(id),x,y);if(vr>ans2) qmax(rs(id),x,y);} else{if(vr>ans2) qmax(rs(id),x,y);if(vl>ans2) qmax(ls(id),x,y);}}
}T;
string main(){cin>>n;for(int i=1;i<=n;i++){cin>>a[i].v[0]>>a[i].v[1];}T.build(rt,1,n,0);int ans=2e9;for(int i=1;i<=n;i++){ans=2e9,ans2=-2e9;T.qmin(rt,a[i].v[0],a[i].v[1]);T.qmax(rt,a[i].v[0],a[i].v[1]);ans=min(ans,ans2-ans1);}cout<<ans<<'\n';return "I Can't Pig";
}
}
namespace kong{bool ed;double MB(){return (&st-&ed)/1048576.0;}}
signed main(){
//	cin.tie(0),cout.tie(0);
//	ios::sync_with_stdio(0);cerr<<zhu::main()<<'\n'<<kong::MB();return 0;
}

in: