hdu1983 dfs+bfs Kaitou Kid - The Phantom Thief

偶是62ms里第一偶也

这题要注意在成功路径上搜，要不MLE,MLE,MLE,MLE.....尼玛

还有vis[][][]要多开一维，有没有拿到的标记是不同的，坑毁了。。MLE

#define DeBUG
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <sstream>
#include <map>
#include <bitset>
using namespace std ;
#define zero {0}
#define INF 2000000000
#define EPS 1e-6
typedef long long LL;
const double PI = acos(-1.0);
inline int sgn(double x)
{
    return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);
}
struct point
{
    int x;
    int y;
    point(int a, int b)
    {
        x = a;
        y = b;
    }
};
struct Node
{
    int x;
    int y;
    int step;
    bool flag;
    std::vector<point> v;
    Node ()
    {
    }
    Node (int a, int b, int c, bool d)
    {
        x = a;
        y = b;
        step = c;
        flag = d;
    }
};
char mp[10][10];
int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
bool vis[10][10][2];
int n, m, t;
int minn;
int sum;
int sx, sy;
int ex, ey;
queue<Node>Q;
void dfs(int kk)
{
    if (kk >= minn)
        return;
    if(minn==0)
        return;
    Node node;
    int x, y;
    bool can = false;
    node.x = sx;
    node.y = sy;
    node.step = 0;
    node.flag = false;
    can = false;
    memset(vis, 0, sizeof(vis));
    vis[sx][sy][0] = 1;
    while (!Q.empty())
    {
        Q.pop();
    }
    Q.push(node);
    while (!Q.empty())
    {
        node = Q.front();
        Q.pop();
        Node temp;
        if (node.step > t)
            continue;
        if (node.x == ex && node.y == ey && node.flag == true)
        {
            can = true;
            break;
        }
        for (int i = 0; i < 4; i++)
        {
            x = node.x + dir[i][0];
            y = node.y + dir[i][1];
            if (x < 0 || y < 0 || x >= n || y >= m || mp[x][y] == '#' )
                continue;
            if (mp[x][y] == 'J')
                temp.flag = true;
            else
                temp.flag = node.flag;
            if (vis[x][y][temp.flag])
                continue;
            temp.v = node.v;
            vis[x][y][temp.flag] = true;
            temp.x = x;
            temp.y = y;
            temp.step = node.step + 1;
            temp.v.push_back(point(x, y));
            Q.push(temp);
        }

    }
    if (!can)
    {
        minn = min(minn, kk);
        return;
    }
    for (int k = 0; k < node.v.size(); k++)
    {
        int i = node.v[k].x;
        int j = node.v[k].y;
        if (mp[i][j] == '.' || mp[i][j] == 'J')
        {
            char c = mp[i][j];
            mp[i][j] = '#';
            dfs(kk + 1);
            mp[i][j] = c;
        }
    }
}
int main()
{
#ifdef DeBUGs
    freopen("C:\\Users\\Sky\\Desktop\\1.in", "r", stdin);
#endif
    int T;
    scanf("%d", &T);
    while (T--)
    {

        scanf("%d%d%d", &n, &m, &t);
        for (int i = 0; i < n; i++)
        {
            scanf("%s", mp[i]);
        }

        minn = 4;
        sum = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                if (mp[i][j] == 'S')
                {
                    sx = i;
                    sy = j;
                }
                if (mp[i][j] == 'E')
                {
                    ex = i;
                    ey = j;
                }
            }
        }
        int de = 0;
        for (int i = 0; i < 4; i++)
        {
            int x = sx + dir[i][0];
            int y = sy + dir[i][0];
            if (x < 0 || y < 0 || x >= n || y >= m)
                continue;
            de++;
        }
        minn = min(minn, de);
        de = 0;
        for (int i = 0; i < 4; i++)
        {
            int x = ex + dir[i][0];
            int y = ey + dir[i][0];
            if (x < 0 || y < 0 || x >= n || y >= m)
                continue;
            de++;
        }
        minn = min(minn, de);
        dfs(0);
        printf("%d\n", minn);

    }
    return 0;
}