[hdu 2102]bfs+注意INF

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2102

感觉这个题非常水，结果一直WA，最后发现居然是0x3f3f3f3f不够大导致的……把INF改成INF+INF就过了。

#include<bits/stdc++.h>
using namespace std;

bool vis[][][];
char s[][][];
const int INF=0x3f3f3f3f;

const int fx[]={,,,-};
const int fy[]={,-,,};

int bfs()
{
    memset(vis,false,sizeof(vis));
    queue< pair<int,int> > q;
    while (!q.empty()) q.pop();
    q.push(make_pair(*+*+,));
    vis[][][]=true;
    while (!q.empty())
    {
        int layer=q.front().first/;
        int x=q.front().first%/;
        int y=q.front().first%;
        int st=q.front().second;
        q.pop();
        for (int i=;i<;i++)
        {
            int xx=x+fx[i];
            int yy=y+fy[i];
            if (s[layer][xx][yy]!='*' && !vis[layer][xx][yy])
            {
                if (s[layer][xx][yy]=='P' || (s[layer][xx][yy]=='#' && s[layer^][xx][yy]=='P')) return st+;
                if (s[layer][xx][yy]=='#' && !vis[layer^][xx][yy])
                {
                    vis[layer][xx][yy]=vis[layer^][xx][yy]=true;
                    q.push(make_pair((layer^)*+xx*+yy,st+));
                }
                if (s[layer][xx][yy]=='.' || s[layer][xx][yy]=='S')
                {
                    vis[layer][xx][yy]=true;
                    q.push(make_pair(layer*+xx*+yy,st+));
                }
            }
        }
    }
    return INF+INF;
}

int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        memset(s,'*',sizeof(s));
        int n,m,t;
        cin >>n >>m >>t;
        for (int _=;_<;_++)
            for (int i=;i<=n;i++)
                for (int j=;j<=m;j++)
                    cin >>s[_][i][j];
        for (int i=;i<=n;i++)
            for (int j=;j<=m;j++)
                if (s[][i][j]=='#'&&s[][i][j]=='#' || s[][i][j]=='#'&&s[][i][j]=='*' || s[][i][j]=='*'&&s[][i][j]=='#') s[][i][j]=s[][i][j]='*';
        if (bfs()<=t) cout <<"YES" <<endl;
        else cout <<"NO" <<endl;
    }
    return ;
}