# [BZOJ3199][半平面交][最短路]SDOI2013：逃考

BZOJ挂，链自找

Code：

#include<bits/stdc++.h>
#define eps 1e-9
#define db double
#define mp make_pair
#define fi first
#define se second
using namespace std;
int res=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
return res*f;
}
const int N=2e5+5;
namespace sssp{
int s;
int d[N],pt[N];
priority_queue<pair<int,int> >q;
inline void dijkstra(){
memset(d,0x3f,sizeof(d));
memset(pt,0,sizeof(pt));
d[s]=0;q.push(mp(0,s));
while(!q.empty()){
int x=q.top().se;q.pop();pt[x]=1;
int y=vis[i];
if(pt[y]) continue;
if(d[y]>d[x]+1){
d[y]=d[x]+1;
q.push(mp(-d[y],y));
}
}
}
}
}
using namespace sssp;
namespace half_plane_intersection{
bool fcmp(double a,double b){return fabs(b-a)<eps;}
struct point{
db x,y;
point(){}
point(db _x,db _y):x(_x),y(_y){}
friend inline point operator + (const point &a,const point &b){return point(a.x+b.x,a.y+b.y);}
friend inline point operator - (const point &a,const point &b){return point(a.x-b.x,a.y-b.y);}
friend inline point operator * (const point &a,const db &b){return point(a.x*b,a.y*b);}
friend inline db operator * (const point &a,const point &b){return a.x*b.y-a.y*b.x;}
inline point ref(){return point(y,-x);}
}p[N];
struct line{
point x,y;
db ang;
int id;
line(){}
line(point _x,point _y):x(_x),y(_y),ang(atan2(y.y-x.y,y.x-x.x)){}
}l[N];
inline bool lft(line a,point b){return (b-a.x)*(a.y-a.x)+eps>0;}
inline bool cmp(line a,line b){
if(fcmp(a.ang,b.ang)) return lft(a,b.y);
return a.ang<b.ang;
}
point itse(line a,line b){
point bs=a.y-a.x;
db tmp=((b.x-a.x)*bs)/(bs*(b.y-b.x));
return b.x+(b.y-b.x)*tmp;
}
inline point mid(point x,point y){return point((x.x+y.x)/2,(x.y+y.y)/2);}
inline line get(point a,point b){
point c=mid(a,b);
return line(c,c+(b-a).ref());
}
int n,tot;
db ans=0,sum=0;
point st;
int q[N];
inline void hp(int x){
int hd=1,ta=2;
sort(l+1,l+tot+1,cmp);
int pos=1;
for(int i=2;i<=tot;i++) if(fabs(l[i].ang-l[pos].ang)>0) l[++pos]=l[i];
tot=pos;
q[1]=1,q[2]=2;
for(int i=3;i<=tot;i++){
while(hd<ta && lft(l[i],itse(l[q[ta-1]],l[q[ta]]))) --ta;
while(hd<ta && lft(l[i],itse(l[q[hd+1]],l[q[hd]]))) ++hd;
q[++ta]=i;
}
while(hd<ta && lft(l[q[hd]],itse(l[q[ta-1]],l[q[ta]]))) --ta;
if(ta-hd<2) return;
int f=1;
for(int i=hd;i<=ta;i++) if(lft(l[q[i]],st)) f=0;
if(f) s=x;
}
db xx,yy;
inline void init(int id){
tot=0;
point p1=point(0,0),p2=point(xx,0),p3=point(xx,yy),p4=point(0,yy);
l[++tot]=line(p1,p2),l[++tot]=line(p2,p3),l[++tot]=line(p3,p4),l[++tot]=line(p4,p1);
for(int i=1;i<=4;i++) l[i].id=n+1;
for(int i=1;i<=n;i++) if(i!=id) l[++tot]=get(p[i],p[id]),l[tot].id=i;
}
}
using namespace half_plane_intersection;
int main(){
while(t--){
scanf("%lf%lf%lf%lf",&xx,&yy,&st.x,&st.y);
for(int i=1;i<=n;i++) scanf("%lf%lf",&p[i].x,&p[i].y);
for(int i=1;i<=n;i++) init(i),hp(i);
dijkstra();
if(d[n+1]==1061109567) cout<<"0"<<"\n";
else cout<<d[n+1]<<"\n";
}
return 0;
}


©️2020 CSDN 皮肤主题: 书香水墨 设计师: CSDN官方博客

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。