2006年百度之星 复赛第5题 追捕 解法 源代码

 

追捕

四 个小孩正在花园里玩追捕游戏。一个小孩扮演逃亡者，其余三个小孩做追捕者。花园是一块由 N 行 M 列方格组成的草地，花园周围有木栏包围着，不能走出，花园里面还有一些障碍物不能够通过。游戏可以进行许多回合，每个回合分成两轮，第一轮追捕者可以进行 追捕行动，第二轮逃亡者可以根据前一轮追捕者的行动开展逃亡旅程。在第一轮里，三个追捕者必须在三人中选择一个人向某个相邻的方格走一步，只有在三个人都 没有可以走的相邻方格时，他们才允许选择停留在原地。在第二轮里，逃亡者也必须选择某个相邻的方格走一步，如果逃亡者没有任何可走的方格，那么逃亡者就被 捕了。四个小孩都不允许走到有障碍物或其他人的方格上，也不能走出花园，因而，四个小孩总是会位于不同的方格上面。

这 些小孩都是非常聪明的，三个追捕者也是团结一致的。追捕者如果有可以捉到逃亡者的方法，那么他们就一定不会错过。逃亡者如果有不被捕获的方法，那么他也不 会犯错。除此之外，追捕者会希望尽快地捉到逃亡者，而逃亡者即使在会被捕获的情况下也会尽可能地拖延时间。给定花园的障碍物的分布图和四个小孩的初始位 置，你知道追捕者有方法捉到逃亡者吗？如果有，他们要经过多少轮后才能捉到逃亡者呢？

输入格式：

输 入文件包含多组测试数据。每组测试数据第一行为两个整数 N 和 M （ 1 ≤ N ≤10 ， 1≤M≤10 ），为花园方格阵列的行数和列数。接下来 N 行，每行 M 个字符，可以为 “ . ” 、 “ # ” 、 “ O ” 和 “ X ” ，分别表示空地、障碍物、追捕者和逃亡者。追捕者总是会有三个，而且四个小孩一开始也都会在空地上面。

输出格式：

每组测试数据输出一行，若追捕者能够捉到逃亡者，则输出他们要经过多少轮后才能成功。轮数的计算包括追捕者和逃亡者进行行动的两轮，逃亡者被捕获的那一轮不算，因而结果总是一个奇数。具体输出格式请参考输出样例。

输入样例：

2 2

OO

OX

3 3

OOO

##X

...

3 3

OO#

###

.OX

3 4

OO##

####

..OX

4 4

OOO.

....

....

...X

5 5

O...O

.....

..#..

.....

O...X

5 5

O...O

.....

...#.

.....

O...X

6 6

......

.O..O.

..##..

..##..

.O..X.

......

6 6

#.....

.O..O.

..##..

..##..

.O..X.

......

10 10

..........

..........

..O....O..

..........

..........

..........

..........

..O....X..

..........

..........

10 10

..........

.#.#.#.#.#

..O.....O.

.#.#.#.#.#

..........

.#.#.#.#.#

..........

.#.#.#.#.#

..O.....X.

.#.#.#.#.#

输出样例：

The escapee will be captured after 1 steps

The escapee will be captured after 7 steps

The escapee will be captured after 5 steps

The escapee will never be captured

The escapee will be captured after 21 steps

The escapee will never be captured

The escapee will be captured after 41 steps

The escapee will never be captured

The escapee will be captured after 39 steps

The escapee will never be captured

The escapee will be captured after 51 steps

 

 

源代码中有注释，因此不再写思路了。

该代码已通过acm.pku.edu.cn测试。

 

/* * common.h * * Created on: 2010-2-6 * Author: edan.deng */ #ifndef COMMON_H_ #define COMMON_H_ #include <iostream> #include <vector> #include <map> #include <queue> #include <string> #include <iomanip> using namespace std; #define min(x,y) ((x>y) ? x=y : x) #define max(x,y) ((x>y) ? x : x=y) #define swap(x,y) ((x)^=(y),(y)^=(x),(x)^=(y)) static const int poo=~(1<<31); static const int notdeal=-1; static const int ftest=0; class ACMCommon{ public: int doit(); int timing(); protected: virtual int InsInput()=0; virtual int InsCompute()=0; virtual int InsOutput()=0; }; #endif /* COMMON_H_ */ /* * common.cpp * * Created on: 2010-8-11 * Author: edan.deng */ #include "common.h" int ACMCommon::doit(){ freopen("in.txt", "r", stdin); while(InsInput()){ InsCompute(); InsOutput(); } return 1; } int ACMCommon::timing(){ clock_t start, finish; double ttime; freopen("in.txt", "r", stdin); while(InsInput()){ start = clock(); InsCompute(); InsOutput(); finish = clock(); ttime = (double) (finish - start) / CLOCKS_PER_SEC; cout << " time:" << ttime << endl; } return 1; } //============================================================================ // Name : Astar0602Hunt.cpp // Author : Edan Wade // Version : not finished // Copyright : personal // Description : http://acm.pku.edu.cn/JudgeOnline/problem?id=2916 //============================================================================ #include "../common.h" /***************************BFSNode abstract class, which provide interface for hunt class**************/ class BFSNode { public: BFSNode():_value(0) {} // 返回_value int value() {return _value;} //设定节点的地点等属性 virtual int FMNode(int alocation[], int aspot, int amove, char atype,int avalue)=0; virtual int FMNode(int alocation[], int avalue)=0; virtual int FMNode(int alocation[])=0; //克隆函数，用于构造 virtual BFSNode* clone()=0; //拷贝函数，用于构造 virtual int copy(BFSNode*)=0; //返回位子信息 virtual int getlocation(int alocation[8])=0; // if state of this = state of anode then return 1; else return 0; //判断时候已经找到目的节点 virtual int isover(BFSNode* anode)=0; // return the movement choice the runner have. //判断是hunter节点还是runner节点 virtual char HorR()=0; // if anode is founded then return 1; else return 0; //清空节点注册表 virtual int clear()=0; //判断节点是否已注册 virtual int isReged(BFSNode* anode)=0; //注册节点 virtual int RegNode(BFSNode* anode, int amovechoice)=0; protected: //对alocation[8]排序，已知条件，第aspot位移动了，移动方向是amove int sort(int alocation[8], int aspot, int amove); //对alocation[8]排序 int sort(int alocation[8]); //转换将alocation[8]转化为节点自己的格式 virtual int setlocation(int alocation[8])=0; int _value; }; int BFSNode::sort(int alocation[], int aspot, int amove) { // sort with pop up. int ti, tj, tt; if (amove == -1) { ti = aspot; tj = aspot - 2; while (tj > 1) { if ((alocation[ti] < alocation[tj]) || ((alocation[ti] == alocation[tj]) && (alocation[ti - 1] < alocation[tj - 1]))) { tt = alocation[ti]; alocation[ti] = alocation[tj]; alocation[tj] = tt; tt = alocation[ti - 1]; alocation[ti - 1] = alocation[tj - 1]; alocation[tj - 1] = tt; } else break; ti = tj; tj--; tj--; } } else { ti = aspot; tj = aspot + 2; while (tj < 8) { if ((alocation[ti] > alocation[tj]) || ((alocation[ti] == alocation[tj]) && (alocation[ti - 1] > alocation[tj - 1]))) { tt = alocation[ti]; alocation[ti] = alocation[tj]; alocation[tj] = tt; tt = alocation[ti - 1]; alocation[ti - 1] = alocation[tj - 1]; alocation[tj - 1] = tt; } else break; ti = tj; tj++; tj++; } } return 1; } int BFSNode::sort(int alocation[8]) { int tt; for (int i = 7; i > 3;) { for (int j = i - 2; j > 1;) { if ((alocation[i] < alocation[j]) || ((alocation[i] == alocation[j]) && (alocation[i - 1] < alocation[j - 1]))) { tt = alocation[i]; alocation[i] = alocation[j]; alocation[j] = tt; tt = alocation[i - 1]; alocation[i - 1] = alocation[j - 1]; alocation[j - 1] = tt; } j--; j--; } i--; i--; } return 1; } /***************************************BFSNodeDec subclass of BFSNode********************************/ //BFSNode的子类，采用的编码方式：alocation[8]转化为10位的10进制正整数。 class BFSNodeDec: public BFSNode { public: BFSNodeDec() {} BFSNodeDec(int alocation, char atype, int avalue) { _location = alocation; _type = atype; _value = avalue; } int FMNode(int alocation[], int aspot, int amove, char atype, int avalue); int FMNode(int alocation[], int avalue); int FMNode(int alocation[]); BFSNode* clone() { return new BFSNodeDec(_location, _type, _value); } int copy(BFSNode*); int clear(); //return location int getlocation(int alocation[]); // if state of this = state of anode then return 1; else return 0; int isover(BFSNode* anode); // if anode is founded then return 1; else return 0; char HorR() { return _type; } int location() { return _location; } int hextodec(BFSNode* anode); // return the movement choice the runner have. int isReged(BFSNode* anode); int RegNode(BFSNode* anode, int amovechoice); protected: int setlocation(int alocation[8]); char _type; int _location; static char* _hunterque; static char* _runnerque; }; char* BFSNodeDec::_hunterque = 0; char* BFSNodeDec::_runnerque = 0; int BFSNodeDec::getlocation(int alocation[8]) { int tlocation = _location; for (int i = 0; i < 8; i++) { alocation[i] = tlocation%10; tlocation /= 10; } return 1; } int BFSNodeDec::setlocation(int alocation[8]) { _location = 0; for (int i = 7; i > 0; i--) { _location += alocation[i]; _location *=10; } _location += alocation[0]; return 1; } int BFSNodeDec::copy(BFSNode* anode) { _location = ((BFSNodeDec*) anode)->location(); _type = anode->HorR(); _value = anode->value(); return 1; } int BFSNodeDec::clear() { if (!_hunterque) _hunterque = new char[100000000]; if (!_runnerque) _runnerque = new char[100000000]; memset(_hunterque, 0, 100000000); memset(_runnerque, -1, 100000000); return 1; } int BFSNodeDec::FMNode(int alocation[8], int aspot, int amove, char atype, int avalue) { //aspot: the digit that moved; //amove: the direction that moved: up -1, down 1; left and right 0; _type = atype; _value = avalue; if ((aspot & 1) && (aspot >> 1)) sort(alocation, aspot, amove); setlocation(alocation); return _location; } int BFSNodeDec::FMNode(int alocation[], int avalue) { _type = 'h'; _value = avalue; setlocation(alocation); return _location; } int BFSNodeDec::FMNode(int alocation[]) { _type = 'r'; sort(alocation); setlocation(alocation); return _location; } int BFSNodeDec::isover(BFSNode* anode) { return _location == (((BFSNodeDec*) (anode))->location()); } int BFSNodeDec::isReged(BFSNode* anode) {// founded return 1 ;else return 0; int tlocationdec = ((BFSNodeDec*)anode)->location(); if (anode->HorR() == 'h') return BFSNodeDec::_hunterque[tlocationdec]; else { if ((BFSNodeDec::_runnerque[tlocationdec]) == -1) return -1; else { BFSNodeDec::_runnerque[tlocationdec]--; return BFSNodeDec::_runnerque[tlocationdec]; } } } int BFSNodeDec::RegNode(BFSNode* anode, int amovechoice) { int tlocationdec = ((BFSNodeDec*)anode)->location(); if (anode->HorR() == 'h') BFSNodeDec::_hunterque[tlocationdec] = 1; else { BFSNodeDec::_runnerque[tlocationdec] = amovechoice; } return 1; } /*****************************************************************************************/ //抽象队列 class BFSNodeQue { public: virtual int push(BFSNode*)=0; virtual BFSNode* pop()=0; virtual int clear()=0; virtual BFSNode* getNode()=0; }; //管理BFSNodeDec型节点的队列 class BFSNodeDecQue: public BFSNodeQue { public: BFSNodeDecQue() { _arrays = new BFSNodeDec[_quesize + 1]; } virtual ~BFSNodeDecQue() { delete[] _arrays; } int push(BFSNode* anode); BFSNode* pop(); BFSNode* getNode() { return new BFSNodeDec(); } int clear(); protected: BFSNodeDec* _arrays; int _begin; int _end; int _size; static const int _quesize; }; const int BFSNodeDecQue::_quesize = 400000; int BFSNodeDecQue::push(BFSNode* anode) { _arrays[_end].copy(anode); _end++; _size++; if (_end == _quesize) _end = 0; if (_size == _quesize) { cout << "error: out of bound" << endl; exit(0); } return 1; } BFSNode* BFSNodeDecQue::pop() { if (_size == 0) return 0; _begin++; _size--; if (_begin == _quesize) { _begin = 0; return (&_arrays[_quesize]); } else return &_arrays[_begin - 1]; } int BFSNodeDecQue::clear() { _begin = 0; _end = 0; _size = 0; return 1; } /***生成组合数**************************************************************************/ //生成组合数的抽象类 class composite { // composite: select m integers from n integers(0..n-1). public: int searchcomposit(int n, int m);//select m from n; virtual ~composite() {}; protected: virtual int deal(int m)=0; virtual int deal()=0; int *com; }; int composite::searchcomposit(int n, int m) { if (!m) deal(); else { char direction = 'f'; int i = 0; while (i >= 0) { if (direction == 'f') { if (i == m) { deal(m); i--; direction = 'b'; } else if (!i) { com[i] = 0; i++; } else { com[i] = com[i - 1] + 1; if (com[i] == (n - m + i + 1)) { i--; direction = 'b'; } else i++; } } else { com[i]++; if (com[i] == (n - m + i + 1)) i--; else { i++; direction = 'f'; } } } } return 1; } //Hunt游戏的生成组合数的实例化类 class HuntComposite: public composite { // composite: select m integers from n integers(0..n-1). public: HuntComposite(BFSNodeQue* que, BFSNode* anode); ~HuntComposite() { if (!com) delete[] com; delete _node; } ; int docomposite(int n, int m, int amap[], int alocation[]); protected: int deal(int m); int deal(); private: int *_map; int *_location; BFSNodeQue* _que; BFSNode* _node; }; int HuntComposite::deal(int m) { // set _location for (int i = 0, j = ((4 - m) << 1); i < m; i++) { _location[j + 1] = (_map[com[i]] >> 4) & 15; _location[j] = _map[com[i]] & 15; j++; j++; } return deal(); } int HuntComposite::deal() { int tlocation[8]; for (int i = 0; i < 8; i++) tlocation[i] = _location[i]; _node->FMNode(tlocation); _que->push(_node); _node->RegNode(_node, 0); return 1; } HuntComposite::HuntComposite(BFSNodeQue* aque, BFSNode* anode) { _que = aque; _node = anode->clone(); com = new int[100]; } int HuntComposite::docomposite(int n, int m, int amap[], int alocation[]) { _map = amap; _location = alocation; searchcomposit(n, m); return 1; } /*****************************************************************************************/ class Hunt: public ACMCommon { public: Hunt() { _que = getQueue(); _endnode = _que->getNode(); } virtual ~Hunt() { delete _endnode; delete _que; } protected: //virtual int InsInput()=0; //virtual int InsCompute()=0; //virtual int InsOutput()=0; //输入一个实例。 int InsInput(); //计算一个实例。 int InsCompute(); //输出一个实例。 int InsOutput(); // 初始化，生成所有起始节点. int InitLoseLocation(); // 宽度优先搜索 int BFS(); //得到管理队列 virtual BFSNodeQue* getQueue(); private: //pN: row; pM: collum. int _m, _n; //map without runner and hunter. int _map[10][10]; int _answer; //the end node / the start node. BFSNode* _endnode; BFSNodeQue* _que; }; BFSNodeQue* Hunt::getQueue() { return new BFSNodeDecQue(); } int Hunt::InsInput() { //set up iamp[][], and _endnode; int i, j, k; char trow[16]; int location[8]; //set _map if (!(cin >> _n >> _m)) return 0; for (i = 0, k = 2; i < _n; i++) { cin >> trow; for (j = 0; j < _m; j++) { if (trow[j] == '#') _map[i][j] = 1; else { _map[i][j] = 0; if (trow[j] == 'X') { location[1] = i; location[0] = j; } else if (trow[j] == 'O') { location[k + 1] = i; location[k] = j; k++; k++; } } }//end for j }//end for i _endnode->FMNode(location); return 1; } int Hunt::InsCompute() { _endnode->clear(); _que->clear(); InitLoseLocation(); _answer=BFS(); return 1; } int Hunt::InsOutput(){ if (_answer) cout<<"Poor Mmxl may be captured after "<<_answer<<" steps:("<<endl; else cout<<"Lucky Mmxl will never be captured:)"<<endl;; return 1; } int Hunt::InitLoseLocation() { int tlocation[10]; HuntComposite thc(_que, _endnode); for (int i = 0; i < _n; i++) for (int j = 0; j < _m; j++) { if (_map[i][j]) continue; //settle X spot tlocation[1] = i; tlocation[0] = j; //settle O in four directions int direction[4][2] = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } }; int tdirectionnum = 2, ti, tj; for (int k = 0; k < 4; k++) { ti = i + direction[k][1]; tj = j + direction[k][0]; if ((ti >= 0) && (ti < _n) && (tj >= 0) && (tj < _m)) { if (_map[ti][tj]) continue; tlocation[tdirectionnum + 1] = ti; tlocation[tdirectionnum] = tj; tdirectionnum++; tdirectionnum++; } } if (tdirectionnum == 10) continue; if (tdirectionnum == 8) { thc.docomposite(0, 0, 0, tlocation); } else { //init tmap int tmapnum = 0; int tmap[100]; for (int i = 0; i < tdirectionnum;) { _map[tlocation[i + 1]][tlocation[i]] = 1; i++; i++; } for (int i = 0; i < _n; i++) for (int j = 0; j < _m; j++) { if (_map[i][j]) continue; tmap[tmapnum] = (i << 4 | j); tmapnum++; } for (int i = 0; i < tdirectionnum;) { _map[tlocation[i + 1]][tlocation[i]] = 0; i++; i++; } thc.docomposite(tmapnum, 4 - (tdirectionnum >> 1), tmap, tlocation); } } return 1; } int Hunt::BFS() { BFSNode* tpopnode = 0; BFSNode* tpushnode = _endnode->clone(); int tstart, tend; int tlocation[8], tlocationcopy[8]; int tn, tm, toldn, toldm, tmove = 0, tvalue; char ttype; int direction[4][2] = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } }; int ans = 0; while (!ans) { tpopnode = _que->pop(); if (tpopnode == 0) break; tpopnode->getlocation(tlocation); ttype = tpopnode->HorR(); tvalue = tpopnode->value(); if (ttype == 'h') {//hunter node, so it is runner turn to move. tstart = 0; tend = 1; } else {// runner node, so it is hunter turn to move. tstart = 2; tend = 7; } //move 4 direction. tmove = 0; for (int i = tstart; i <= tend;) { for (int j = 0; j < 4; j++) { tn = tlocation[i + 1] + direction[j][1]; tm = tlocation[i] + direction[j][0]; //over bound if ((tn < 0) || (tn >= _n) || (tm < 0) || (tm >= _m)) continue; // the spot can't be move on. if (_map[tn][tm]) continue; // the spot is already located by others. int tk; for (tk = 0; tk < 8;) { if ((tlocation[tk] == tm) && (tlocation[tk + 1] == tn)) break; tk++; tk++; } if (tk != 8) continue; tmove++; //else it is ok. toldn = tlocation[i + 1]; toldm = tlocation[i]; tlocation[i + 1] = tn; tlocation[i] = tm; for (int tc = 0; tc < 8; tc++) tlocationcopy[tc] = tlocation[tc]; tpushnode->FMNode(tlocationcopy, i + (direction[j][1] & 1), direction[j][1], (ttype == 'h' ? 'r' : 'h'), tvalue + 1); if (ttype == 'h') {//hunter node, so it is runner turn to move. int tmovechoice = tpushnode->isReged(tpushnode); if (tmovechoice == -1) { tmovechoice = 0; for (int mi = 0; mi < 4; mi++) {//X' movechoice int tmn, tmm; tmn = tlocation[1] + direction[mi][1]; tmm = tlocation[0] + direction[mi][0]; //over bound if ((tmn < 0) || (tmn >= _n) || (tmm < 0) || (tmm >= _m)) continue; // the spot can't be move on. if (_map[tmn][tmm]) continue; // the spot is already located by others. int k; for (k = 0; k < 8;) { if ((tlocation[k] == tmm) && (tlocation[k + 1] == tmn)) break; k++; k++; } if (k != 8) continue; tmovechoice++; } tmovechoice--; tpushnode->RegNode(tpushnode, tmovechoice); } if (tmovechoice == 0) { _que->push(tpushnode); } } else {// runner node, so it is hunter turn to move. if (tpushnode->isover(_endnode)) ans = tpushnode->value(); else if (!(tpushnode->isReged(tpushnode))) { tpushnode->RegNode(tpushnode, 0); _que->push(tpushnode); } } tlocation[i + 1] = toldn; tlocation[i] = toldm; } i++; i++; } //runner node, it is hunter turn and hunter can't move. if ((ttype == 'r') && (!tmove)) { tpushnode->FMNode(tlocation, tvalue + 1); if (tpushnode->isover(_endnode)) ans = tpushnode->value(); else if (!(tpushnode->isReged(tpushnode))) { tpushnode->RegNode(tpushnode, 0); _que->push(tpushnode); } } }//end while return ans; }