TYVJ1232最短路(SPFA+连接表)

链接网址：http://tyvj.cn/Problem_Show.asp?id=1232

 

#include <iostream>//   vector前插的SPFA
#include<queue>
#include<cstring>
using namespace std;
#define inf 0x3fffffff
#define M 250005 //最大点数

struct edge
{
    int v;   //链接边的弧头序号 
    int w;   //权值大小 
    int next;//下一条边 
}e[2000005];   //估计好有多少条边

int pre[M], cnt, dist[M], n , m;
int d[4][2]={0,1,-1,0,0,-1,1,0};
bool inq[M];
char map[505][505];
//注意双向加边
void addedge (int u, int v, int w) //加边函数，慢慢模拟就会明白的
{
    e[cnt].v = v;
    e[cnt].w = w;
    e[cnt].next = pre[u]; //接替已有边
    pre[u] = cnt++; //自己前插成为u派生的第一条边(边的条数)
}

void SPFA(int u)
{
    int v, w, i;
    for (i = 1; i <= n*m; i++) //对于从1到n的编号
        dist[i] = inf, inq[i] = false;
    dist[u] = 0;
    queue<int> q;
    while(!q.empty()) q.pop();//队列初始化 
    q.push (u);
    inq[u] = true;
    while (!q.empty())
    {
        u = q.front();
        q.pop();
        inq[u] = false;
        for (i = pre[u]; i != -1; i = e[i].next)
        {
            w = e[i].w;
            v = e[i].v;
            if (dist[u] + w < dist[v])
            {
                dist[v] = dist[u] + w;
                if (!inq[v])
                {
                    q.push (v);
                    inq[v] = true;
                }
            }
        }
    }
}

int main()
{
    int i,j,k,u,v,w,x,y,sx,sy,tx,ty;
    cin>>n>>m;
    {
          cnt = 0;
          memset (pre, -1, sizeof(pre));
          cin.get();
          for(i=1;i<=n;i++){
              for(j=1;j<=m;j++){
                  cin>>map[i][j];
              }    
          }
          for(i=1;i<=n;i++)
              for(j=1;j<=m;j++)
                  for(k=0;k<4;k++){
                      x=i+d[k][0];
                      y=j+d[k][1];
                      
                      if(x>0 && x<=n && y>0 && y<=m ){
                             w=1;
                             if( map[i][j]!=map[x][y])  w=2;                            
                             addedge((i-1)*m+j,(x-1)*m+y,w);
                             addedge((x-1)*m+y,(i-1)*m+j,w);
                      }                                   
                  }
          cin>>sx>>sy>>tx>>ty;
          int start=(sx-1)*m+sy;
          int end=(tx-1)*m+ty;
          //cout<<start<<" "<<end<<endl; 
          SPFA(start);
          cout<<dist[end]<<endl;                 
    }
    //system("pause");
    return 0;
}