analysis
符合分层最短路的特征,于是考虑使用分层最短路
第一层只走横向边,边该怎么连就怎么连
第二层只走纵向边,同理
两层之间的点之间连一条权值为1的边,代表换方向的花费
然后就跑一个最短路就可以了(这题不卡spfa)
具体处理的时候可以把起点和终点看做可以0花费变向的点和其他转向点一起处理,且各个坐标分别按照x和ysort一遍,然后就可以建图了
code
#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define ll long long
template<typename T>void read(T &x){
x=0;char r=getchar();T neg=1;
while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
x*=neg;
}
int n,m;
const int maxn=20000+10,maxm=100000+10;
struct station{
int x;
int y;
int id;
}S,T,turn_p[maxm];
inline bool cmpx(station a,station b){
return a.x==b.x?a.y<b.y:a.x<b.x;
}
inline bool cmpy(station a,station b){
return a.y==b.y?a.x<b.x:a.y<b.y;
}
struct node{
int e;
int w;
int nxt;
}edge[maxm*8];
int cnt=0;
int head[maxm<<1];
inline void addl(int u,int v,int w){
edge[cnt].e=v;
edge[cnt].w=w;
edge[cnt].nxt=head[u];
head[u]=cnt++;
}
ll dis[maxm<<1];
struct point{
int pos;
ll w;
point():pos(0),w(0){}
point(int pos,ll w):pos(pos),w(w){}
friend bool operator<(point a,point b){
return a.w>b.w;
}
};
priority_queue<point>q;
void dijkstra(){
clean(dis,0x3f);
dis[m+1]=0;
q.push(point(m+1,0));
while(q.empty()==false){
int f=q.top().pos;
q.pop();
for(int i=head[f];i!=-1;i=edge[i].nxt){
int v=edge[i].e;
if(dis[v]>dis[f]+edge[i].w){
dis[v]=dis[f]+edge[i].w;
q.push(point(v,dis[v]));
}
}
}
if(dis[m+2]<0x3f3f3f3f3f3f3f3f)
printf("%lld\n",dis[m+2]);
else printf("-1\n");
}
int main(){
#ifndef ONLINE_JUDGE
freopen("datain.txt","r",stdin);
#endif
clean(head,-1);
read(n);
read(m);
loop(i,1,m+2){
turn_p[i].id=i;
read(turn_p[i].x);
read(turn_p[i].y);
}
sort(turn_p+1,turn_p+1+m+2,cmpx);
loop(i,1,m+1){
if(turn_p[i].x==turn_p[i+1].x){
addl(turn_p[i].id,turn_p[i+1].id,2*abs(turn_p[i+1].y-turn_p[i].y));
addl(turn_p[i+1].id,turn_p[i].id,2*abs(turn_p[i+1].y-turn_p[i].y));
}
}
sort(turn_p+1,turn_p+1+m+2,cmpy);
loop(i,1,m+1){
if(turn_p[i].y==turn_p[i+1].y){
addl(turn_p[i].id+m+2,turn_p[i+1].id+m+2,2*abs(turn_p[i+1].x-turn_p[i].x));
addl(turn_p[i+1].id+m+2,turn_p[i].id+m+2,2*abs(turn_p[i+1].x-turn_p[i].x));
}
}
loop(i,1,m+2){
addl(i,i+m+2,1);
addl(i+m+2,i,1);
}
addl(m+1,m+1+m+2,0);
addl(m+1+m+2,m+1,0);
addl(m+2,m+2+m+2,0);
addl(m+2+m+2,m+2,0);
dijkstra();
return 0;
}