hdu 4634 Swipe Bo bfs+状态压缩

题目链接

状态压缩记录当前拿到了哪些钥匙， 然后暴力搜索。

搞了好几个小时， 一开始也不知道哪里错了， 最后A了也不知道一开始哪里有问题。

#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define pb(x) push_back(x)
#define ll long long
#define mk(x, y) make_pair(x, y)
#define lson l, m, rt<<1
#define mem(a) memset(a, 0, sizeof(a))
#define rson m+1, r, rt<<1|1
#define mem1(a) memset(a, -1, sizeof(a))
#define mem2(a) memset(a, 0x3f, sizeof(a))
#define rep(i, n, a) for(int i = a; i<n; i++)
#define fi first
#define se second
typedef pair<int, int> pll;
const double PI = acos(-1.0);
const double eps = 1e-;
const int mod = 1e9+;
const int inf = ;
const int dir[][] = { {-, }, {, }, {, -}, {, } };
const int maxn = ;
int n, m, cnt, g[maxn][maxn];
bool vis[maxn][maxn][<<][], used[maxn][maxn][<<];
char s[maxn][maxn];
struct node
{
    int x, y, step, key;
    node(){}
    node(int _x, int _y, int _step, int _key): x(_x), y(_y), step(_step), key(_key){}
};
queue <node> q;
int check(int x, int y) {
    if(x>=&&x<n&&y>=&&y<m)
        return ;
    return ;
}
int judge(int x, int y) {
    if(x == )
        return ;
    if(x == -)
        return ;
    if(y == )
        return ;
    if(y == -)
        return ;
}
void bfs(int x, int y) {
    mem(vis);
    mem(used);
    while(!q.empty())
        q.pop();
    used[x][y][] = ;
    q.push(node(x, y, , ));
    while(!q.empty()) {
        node temp = q.front(); q.pop();
        int x = temp.x, y = temp.y, tmpx, tmpy;
        for(int i = ; i < ; i++) {
            int dirx = dir[i][], diry = dir[i][];
            tmpx = x, tmpy = y;
            int key = temp.key;
            node tmp = temp;
            if(!check(tmpx+dirx, tmpy+diry) || s[tmpx+dirx][tmpy+diry]=='#')
                continue;
            while() {
                if(s[tmpx][tmpy] == 'L')
                    dirx = , diry = -;
                if(s[tmpx][tmpy] == 'R')
                    dirx = , diry = ;
                if(s[tmpx][tmpy] == 'U')
                    dirx = -, diry = ;
                if(s[tmpx][tmpy] == 'D')
                    dirx = , diry = ;
                int tmpdir = judge(dirx, diry);
                if(vis[tmpx][tmpy][tmp.key][tmpdir])
                    break;
                vis[tmpx][tmpy][tmp.key][tmpdir] = ;
                if(s[tmpx][tmpy] == 'E' && key == (<<cnt)-) {
                    printf("%d\n", temp.step+);
                    return ;
                }
                if(s[tmpx][tmpy] == 'K')
                    key |= g[tmpx][tmpy];
                if(check(tmpx+dirx, tmpy+diry)) {
                    if(s[tmpx+dirx][tmpy+diry] == '#') {
                        tmp.x = tmpx;
                        tmp.y = tmpy;
                        tmp.step++;
                        tmp.key = key;
                        q.push(tmp);
                        used[tmpx][tmpy][tmp.key] = ;
                        break;
                    } else {
                        tmpx += dirx;
                        tmpy += diry;
                    }
                } else {
                    break;
                }
            }
        }
    }
    puts("-1");
    return ;
}
void solve() {
    cnt = ;
    int x, y;
    for(int i = ; i < n; i++) {
        for(int j = ; j < m; j++) {
            if(s[i][j] == 'S')
                x = i, y = j;
            if(s[i][j] == 'K') {
                g[i][j] = <<cnt;
                cnt++;
            }
        }
    }
    bfs(x, y);
}
void read() {
    for(int i = ; i < n; i++)
        scanf("%s", s[i]);
}
int main()
{
    while(scanf("%d%d", &n, &m)!=EOF) {
        read();
        solve();
    }
    return ;
}