NOIP2013PUZZLE

 #include<cstdio>
 #include<cstring>
 #define MIN(A,B) (A)<(B)?(A):(B)
 using namespace std;
 const int dx[]={,-,,},dy[]={,,,-},INF=0x3f3f3f3f;
 int puz[][],n,m,step[][][][];
 int bfs(int sx,int sy,int tx,int ty)
 {
     struct node
     {
         int x,y;
     }q[],*qf=q,*qb=q+;
     int d[][];
     if(!puz[sx][sy]||!puz[tx][ty])return INF;
     if(sx==tx&&sy==ty)return ;
     memset(d,0x3f,sizeof(d));
     qf->x=sx;
     qf->y=sy;
     d[sx][sy]=;
     while(qf!=qb)
     {
         for(int i=;i<;i++)
         {
             qb->x=qf->x+dx[i];
             qb->y=qf->y+dy[i];
             if(puz[qb->x][qb->y]&&d[qb->x][qb->y]==INF)
             {
                 d[qb->x][qb->y]=d[qf->x][qf->y]+;
                 if(qb->x==tx&&qb->y==ty)return d[tx][ty];
                 qb++;
             }
         }
         qf++;
     }
     return INF;
 }
 void work()
 {
     struct node
     {
         int x,y,z;
     }q[],*qf=q,*qb=q;
     bool qing[][][];
     int d[][][],ex=,ey=,sx=,sy=,tx=,ty=;
     scanf("%d%d%d%d%d%d",&ex,&ey,&sx,&sy,&tx,&ty);
     if(!puz[ex][ey]||!puz[sx][sy]||!puz[tx][ty])
     {
         puts("-1");
         return;
     }
     if(sx==tx&&sy==ty)
     {
         puts("");
         return;
     }
     memset(qing,,sizeof(qing));
     memset(d,0x3f,sizeof(d));
     puz[sx][sy]=;
     for(int i=;i<;i++)
     {
         int x=sx+dx[i];
         int y=sy+dy[i];
         if(puz[x][y])
         {
             d[sx][sy][i]=bfs(ex,ey,x,y);
             qing[sx][sy][i]=true;
             qb->x=sx;
             qb->y=sy;
             qb->z=i;
             qb++;
         }
     }
     puz[sx][sy]=;
     while(qf!=qb)
     {
         qing[qf->x][qf->y][qf->z]=false;
         for(int i=;i<;i++)
         {
             qb->x=qf->x+dx[i];
             qb->y=qf->y+dy[i];
             qb->z=i^;
             if(puz[qb->x][qb->y]&&d[qb->x][qb->y][qb->z]>d[qf->x][qf->y][qf->z]+step[qf->x][qf->y][qf->z][i]+)
             {
                 d[qb->x][qb->y][qb->z]=d[qf->x][qf->y][qf->z]+step[qf->x][qf->y][qf->z][i]+;
                 if(!qing[qb->x][qb->y][qb->z])
                 {
                     qing[qb->x][qb->y][qb->z]=true;
                     qb++;
                 }
             }
         }
         qf++;
     }
     int ans=INF;
     for(int i=;i<;i++)
         ans=MIN(ans,d[tx][ty][i]);
     if(ans!=INF)printf("%d\n",ans);
     else puts("-1");
 }
 int main()
 {
     //freopen("puzzle.in","r",stdin);
     //freopen("puzzle.out","w",stdout);
     int q=;
     scanf("%d%d%d",&n,&m,&q);
     for(int i=;i<=n;i++)
         for(int j=;j<=m;j++)
             scanf("%d",*(puz+i)+j);
     for(int i=;i<=n;i++)
         for(int j=;j<=m;j++)
         {
             int t=puz[i][j];
             puz[i][j]=;
             for(int k=;k<;k++)
                 for(int h=;h<;h++)
                     step[i][j][k][h]=bfs(i+dx[k],j+dy[k],i+dx[h],j+dy[h]);
             puz[i][j]=t;
         }
     while(q--)work();
     return ;
 }

测试数据 #0: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #1: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #2: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #3: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #4: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #5: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #6: Accepted, time = 0 ms, mem = 784 KiB, score = 5

测试数据 #7: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #8: Accepted, time = 0 ms, mem = 792 KiB, score = 5

测试数据 #9: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #10: Accepted, time = 0 ms, mem = 792 KiB, score = 5

测试数据 #11: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #12: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #13: Accepted, time = 15 ms, mem = 792 KiB, score = 5

测试数据 #14: Accepted, time = 31 ms, mem = 788 KiB, score = 5

测试数据 #15: Accepted, time = 15 ms, mem = 792 KiB, score = 5

测试数据 #16: Accepted, time = 0 ms, mem = 788 KiB, score = 5

测试数据 #17: Accepted, time = 15 ms, mem = 788 KiB, score = 5

测试数据 #18: Accepted, time = 15 ms, mem = 788 KiB, score = 5

测试数据 #19: Accepted, time = 15 ms, mem = 788 KiB, score = 5

Accepted, time = 106 ms, mem = 792 KiB, score = 100