hdu 1885 Key Task

最新推荐文章于 2020-11-20 18:06:27 发布

GadyPu

最新推荐文章于 2020-11-20 18:06:27 发布

阅读量319

点赞数

分类专栏：搜索

本文链接：https://blog.csdn.net/u012077152/article/details/46841957

版权

搜索专栏收录该内容

50 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=1885
状压bfs，每个格子16种状态，用三维数组标记即可。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
using std::cin;
using std::cout;
using std::endl;
using std::find;
using std::sort;
using std::map;
using std::pair;
using std::queue;
using std::vector;
using std::multimap;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr,val) memset(arr,val,sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 102;
typedef unsigned long long ull;
char G[N][N];
bool vis[N][N][18];
int H, W, Sx, Sy;
const int dx[] = { 0, 0, -1, 1 }, dy[] = { -1, 1, 0, 0 };
struct Node {
    int x, y, key, s;
    Node() {}
    Node(int i, int j, int k, int l) :x(i), y(j), key(k), s(l) {}
};
inline int work(char ch) {
    if (ch == 'B' || ch == 'b') return 0;
    if (ch == 'Y' || ch == 'y') return 1;
    if (ch == 'R' || ch == 'r') return 2;
    if (ch == 'G' || ch == 'g') return 3;
    return 0;
}
void bfs() {
    bool f = true;
    cls(vis, false);
    queue<Node> q;
    q.push(Node(Sx, Sy, 0, 0));
    vis[Sx][Sy][0] = true;
    while (!q.empty()) {
        Node t = q.front(); q.pop();
        if (G[t.x][t.y] == 'X') {
            printf("Escape possible in %d steps.\n", t.s);
            return;
        }
        rep(i, 4) {
            int key = t.key, x = t.x + dx[i], y = t.y + dy[i];
            if (x < 0 || x >= H || y < 0 || y >= W) continue;
            if (vis[x][y][key] || G[x][y] == '#') continue;
            if (isupper(G[x][y]) && G[x][y] != 'X' && !(key &(1 << work(G[x][y])))) continue;
            if (islower(G[x][y])) key |= 1 << work(G[x][y]);
            q.push(Node(x, y, key, t.s + 1));
            vis[x][y][key] = true;
        }
    }
    puts("The poor student is trapped!");
}
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    while (~scanf("%d %d", &H, &W), H + W) {
        rep(i, H) {
            scanf("%s", G[i]);
            rep(j, W) {
                if (G[i][j] == '*') Sx = i, Sy = j;
            }
        }
        bfs();
    }
    return 0;
}