电路维修 Page120 双端队列BFS

电路维修 Page120 双端队列BFS

出了小问题，代码很不美观而且很繁琐，看了别人的代码，原因是自己的理解不太够，只能靠强行草过去

对于拓展代价为0或1的问题，还可以使用最短路算法直接进行操作，这题用最短路就没那么多屁事了

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=1e3+7;
const int INF=1e9;
const ll INFF=1e18;
char s[maxn][maxn];
int d[maxn][maxn],n,m,x2,y2,x1,yy,tmp,t;
int x[4]={1,1,-1,-1};
int y[4]={1,-1,1,-1};
void bfs(int sx,int sy)
{
    deque<int> q;q.push_front(sx);
    while(!q.empty())
    {
        tmp=q.front();q.pop_front();
        x1=tmp/(m+1);yy=tmp%(m+1);
        rep(i,0,3)
        {
            x2=x1+x[i];
            y2=yy+y[i];
            if (x2<0||x2>n||y2<0||y2>m)continue;
            if (i==0)
            {
                if (s[x1][yy]=='\\')
                {
                    if (d[x1][yy]<d[x2][y2])
                    {
                        d[x2][y2]=d[x1][yy];
                        q.push_front(x2*(m+1)+y2);
                    }
                }
                if (s[x1][yy]=='/')
                {
                    if (d[x1][yy]+1<d[x2][y2])
                    {
                        d[x2][y2]=d[x1][yy]+1;
                        q.push_back(x2*(m+1)+y2);
                    }
                }
            }
            else if (i==1)
            {
                if (s[x1][y2]=='/')
                {
                    if (d[x1][yy]<d[x2][y2])
                    {
                        d[x2][y2]=d[x1][yy];
                        q.push_front(x2*(m+1)+y2);
                    }
                }
                if (s[x1][y2]=='\\')
                {
                    if (d[x1][yy]+1<d[x2][y2])
                    {
                        d[x2][y2]=min(d[x1][yy]+1,d[x2][y2]);
                        q.push_back(x2*(m+1)+y2);
                    }
                }
            }
            else if (i==2)
            {
                if (s[x2][yy]=='/')
                {
                    if (d[x1][yy]<d[x2][y2])
                    {
                        d[x2][y2]=d[x1][yy];
                        q.push_front(x2*(m+1)+y2);
                    }
                }
                if (s[x2][yy]=='\\')
                {
                    if (d[x1][yy]+1<d[x2][y2])
                    {
                        d[x2][y2]=min(d[x1][yy]+1,d[x2][y2]);
                        q.push_back(x2*(m+1)+y2);
                    }
                }
            }
            else if (i==3)
            {
                if (s[x2][y2]=='\\')
                {
                    if (d[x1][yy]<d[x2][y2])
                    {
                        d[x2][y2]=d[x1][yy];
                        q.push_front(x2*(m+1)+y2);
                    }
                }
                if (s[x2][y2]=='/')
                {
                    if (d[x1][yy]+1<d[x2][y2])
                    {
                        d[x2][y2]=d[x1][yy]+1;
                        q.push_back(x2*(m+1)+y2);
                    }
                }
            }
        }
    }
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        rep(i,0,n)rep(j,0,m)d[i][j]=INF;
        d[0][0]=0;
        rep(i,0,n-1)scanf("%s",s[i]);
        if((n+m)%2==1)
		{
			printf("NO SOLUTION\n");
			continue;
		}
        bfs(0,(n+1)*(m+1)-1);
        W(d[n][m]);
    }
    return 0;
}