P3831 [SHOI2012]回家的路

https://www.luogu.org/problemnew/show/P3831 

总结：构建分层图！！ 

__gnu_pbds::priority_queue<node>q;快到飞

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)


//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/



const int maxn=3e5+9;
const int mod=1e9+7;

int d[maxn];
int num[maxn];
bool vis[maxn];
int head[maxn];
int tot;
int n,m,mm;
struct E
{
    int to,cost,nex;
}edge[maxn*30];
struct point
{
    int x,y,id;
}p[maxn];
struct node
{
    int to,cost;
    node(){}
    node(int _to,int _cost)
    {
        to=_to;
        cost=_cost;
    }
    bool operator < (const node &b) const
    {
        return cost>b.cost;
    }
};

void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].cost=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void init()
{
    mem(head,-1);
    tot=0;
}
void dj(int s)
{
    mem(d,INF);
    mem(vis,0);
    __gnu_pbds::priority_queue<node>q;
    d[s]=0;
    q.push(node(s,0));
    while(!q.empty())
    {
        node tmp=q.top();
        q.pop();
        int u=tmp.to;
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=head[u];i!=-1;i=edge[i].nex)
        {
            int v=edge[i].to;
            int w=edge[i].cost;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                if(!vis[v]) q.push(node(v,d[v]));
            }
        }

    }
}
bool cmp1(point a,point b)
{
    if(a.x!=b.x) return a.x<b.x;
    return a.y<b.y;
}
bool cmp2(point a,point b)
{
    if(a.y!=b.y) return a.y<b.y;
    return a.x<b.x;
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    init();
    int n,m;
    scanf("%d%d",&n,&m);
    n=m+2;

    for(int i=1;i<=n;i++)
    {
        int u,v;
        scanf("%d%d",&p[i].x,&p[i].y);
        p[i].id=i;
    }

    sort(p+1,p+n+1,cmp1);
    for(int i=1;i<n;i++)
    {
        if(p[i].x==p[i+1].x) addedge(p[i].id,p[i+1].id,2*(p[i+1].y-p[i].y)),addedge(p[i+1].id,p[i].id,2*(p[i+1].y-p[i].y));
    }
    sort(p+1,p+n+1,cmp2);
    for(int i=1;i<n;i++)
    {
        if(p[i].y==p[i+1].y) addedge(p[i].id+n,p[i+1].id+n,2*(p[i+1].x-p[i].x)),addedge(p[i+1].id+n,p[i].id+n,2*(p[i+1].x-p[i].x));
    }
    for(int i=1;i<=m;i++)
    {
        addedge(i,i+n,1);
        addedge(i+n,i,1);
    }
    addedge(n-1,n-1+n,0);
    addedge(n-1+n,n-1,0);
    addedge(n,n+n,0);
    addedge(n+n,n,0);
    dj(n-1);
    if(d[n]==INF) puts("-1");
    else printf("%d\n",d[n]);
    return 0;
}