P3831 [SHOI2012]回家的路

[SHOI2012]回家的路 - 洛谷

算法标签：分层图+最短路

难度：提高+/省选-

因为只有横竖两种走法，那么考虑建双层图，第一层建横向边，第二层建竖向边。首先按照 x 坐标的大小排序，如果两个点 x 坐标相等,就把它们连起来

之后在层与层之间建边，除起点、终点外的每个点都建一条权值为 1 的边。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define M 200010
#define INF 0x3f3f3f3f
int n,m,cnt,h[M],v[M],d[M];
struct NodeA
{
	int x,y;
	int id;
}a[M];

struct NodeB
{
	int nxt,to,val;
}e[3*M];

queue <int> q;

int read ()
{
	int s=0,k=1;char c=getchar ();
	while (!isdigit (c)) {if (c=='-') k=-1;c=getchar ();}
	while (isdigit (c)) {s=s*10+c-'0';c=getchar ();}
	return k*s;
}

bool cmp1 (NodeA p,NodeA q)
{
	if (p.x!=q.x)
		return p.x<q.x;
	return p.y<q.y;
}

bool cmp2 (NodeA p,NodeA q)
{
	if (p.y!=q.y)
		return p.y<q.y;
	return p.x<q.x;
}

void Add (int x,int y,int w)
{
	e[++cnt].nxt=h[x];h[x]=cnt;
	e[cnt].to=y;e[cnt].val=w;
}

void Init ()
{
	n=read ();m=read ();
	for (int i=1;i<=m+2;i++)
	{
		a[i].x=read ();a[i].y=read ();
		a[i].id=i;
	}
}

void Build ()
{
	sort (a+1,a+1+m+2,cmp1);
	for (int i=1;i<m+2;i++)
		if (a[i].x==a[i+1].x)
		{
			int x=a[i].id,y=a[i+1].id;
			int w=2*(a[i+1].y-a[i].y);
			Add (x,y,w);Add (y,x,w);
		}
	sort (a+1,a+1+m+2,cmp2);
	for (int i=1;i<m+2;i++)
		if (a[i].y==a[i+1].y)
		{
			int x=a[i].id+m+2,y=a[i+1].id+m+2;
			int w=2*(a[i+1].x-a[i].x);
			Add (x,y,w);Add (y,x,w);
		}
	for (int i=1;i<=m+2;i++)
	{
		int x=i,y=i+m+2,w=1;
		if (i>m) w=0;
		Add (x,y,w);Add (y,x,w);
	}
}

void SPFA ()
{
	memset (d,0x3f,sizeof (d));
	d[m+1]=0;
	v[m+1]=1;
	q.push (m+1);
	while (!q.empty ())
	{
		int x=q.front ();q.pop ();
		v[x]=0;
		for (int i=h[x];i;i=e[i].nxt)
		{
			int y=e[i].to,w=e[i].val;
			if (d[x]+w<d[y])
			{
				d[y]=d[x]+w;
				if (!v[y])
				{
					v[y]=1;
					q.push (y);
				}
			}
		}
	}
}

void Work ()
{
	Build ();
	SPFA ();
	if (d[m+2]!=INF)
		printf ("%d\n",d[m+2]);
	else
		puts ("-1");
}

int main ()
{
	Init ();
	Work ();
	return 0;
}