hdu 5025 Saving Tang Monk
状态压缩的BFS,一般适用于每种状态能在有限空间内表示的情况
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int MAXN = 101;
int n, m;
bool vis[MAXN][MAXN][10][35];
int snake[10][2], csnk;
char da[MAXN][MAXN];
int Kong[2], Tang[2], dir[4][2] = {0,1, 0,-1, -1,0, 1,0};
struct _node
{
int x, y, nk, snk, cost;
_node (){}
_node (int ix, int iy, int ink, i......
阅读全文