【luogu P2385 青铜莲花池】 题解

题目链接：https://www.luogu.org/problemnew/show/P2385

莲花池什么的最漂亮啦！

最近刷了两天搜索= =我搜索一直是弱菜

直接套bfs

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 using namespace std;
 int n, m, m1, m2, sx, sy, ex, ey;
 struct point{
     int x, y, t;
 }q[];
 int ma[][];
 int fx[];
 int fy[];
 void bfs()
 {
     int tail = ,head = ;
     q[head].x = sx, q[head].y = sy, q[head].t = ;
     while(head!=tail)
     {
         for(int i = ; i <= ; i++)
         {
             int nowx = q[head].x + fx[i];
             int nowy = q[head].y + fy[i];
             if(nowx == ex && nowy == ey)
             {
                 printf("%d",q[head].t+);
                 return ;
             }
             if(nowx > m || nowx <=  || nowy > n || nowy <=  || ma[nowx][nowy] ==  ) continue;
             ma[nowx][nowy] = ;
             q[tail].x = nowx;
             q[tail].y = nowy;
             q[tail].t = q[head].t + ;
             tail++;
         }
         head++;
     }

 }
 int main()
 {
     memset(ma,,sizeof(ma));
     scanf("%d%d%d%d",&m,&n,&m1,&m2);
     for(int i = ; i <= m; i++)
     for(int j = ; j <= n; j++)
     {
         scanf("%d",&ma[i][j]);
         if(ma[i][j]==)
         {
             sx = i;
             sy = j;
         }
         if(ma[i][j]==)
         {
             ex = i;
             ey = j;
         }
         if(ma[i][j] == )
         {
             ma[i][j] = ;
         }
     }
     fx[] = m1, fx[] = m1, fx[] = -m1, fx[] = -m1, fx[] = m2, fx[] = m2, fx[] = -m2, fx[] = -m2;
     fy[] = m2, fy[] = -m2, fy[] = m2, fy[] = -m2, fy[] = m1, fy[] = -m1, fy[] = m1, fy[] = -m1;
     bfs();
     return ;
 }