Roll The Cube
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 777 Accepted Submission(s): 326
Problem Description
This is a simple game.The goal of the game is to roll two balls to two holes each.
'B' -- ball
'H' -- hole
'.' -- land
'*' -- wall
Remember when a ball rolls into a hole, they(the ball and the hole) disappeared, that is , 'H' + 'B' = '.'.
Now you are controlling two balls at the same time.Up, down , left , right --- once one of these keys is pressed, balls exist roll to that direction, for example , you pressed up , two balls both roll up.
A ball will stay where it is if its next point is a wall, and balls can't be overlap.
Your code should give the minimun times you press the keys to achieve the goal.
Input
First there's an integer T(T<=100) indicating the case number.
Then T blocks , each block has two integers n , m (n , m <= 22) indicating size of the map.
Then n lines each with m characters.
There'll always be two balls(B) and two holes(H) in a map.
The boundary of the map is always walls(*).
Output
The minimum times you press to achieve the goal.
Tell me "Sorry , sir , my poor program fails to get an answer." if you can never achieve the goal.
Sample Input
4 6 3 *** *B* *B* *H* *H* *** 4 4 **** *BB* *HH* **** 4 4 **** *BH* *HB* **** 5 6 ****** *.BB** *.H*H* *..*.* ******
Sample Output
3 1 2 Sorry , sir , my poor program fails to get an answer.
题目大意:
两个球,可以向四周滚动,问最少的时间将两个球滚到两个洞里去。
题目分析:我遇到的搞不清的点就是怎么判断球前是否有球,后来发现这道题和HDOJ-2821 Pusher这道题有相同的处理,就是先走然后判断,满足条件则做后续的处理否则跳过,不做处理。还有一个点就是queue中的Node放什么,这里放两小球和俩洞的坐标,还有俩小球和洞的状态(至于为啥,我不太清楚)。这里用一个四维的vis数组做标记,是因为一个小球访问当前位置,另一个小球可能在除了当前位置的任何位置,用两个二维数组分别标志两个小球是不可以的。
代码:
#include<iostream>
#include<queue>
#define maxn 25
using namespace std;
int n, m, ans;
int sx[2], sy[2];
int dx[] = { -1,1,0,0 };
int dy[] = {0,0,-1,1};
char mp[maxn][maxn];
char s[maxn];
bool vis[maxn][maxn][maxn][maxn];
struct Node
{
int x[2], y[2], step;
int b[2], h[2];
}cur,now;
queue<Node> q;
bool bfs() {
int i, j, t, flag;
memset(vis, 0, sizeof(vis));
while (!q.empty())q.pop();
cur.x[0] = sx[0], cur.y[0] = sy[0];
cur.x[1] = sx[1], cur.y[1] = sy[1];
cur.h[0] = cur.h[1] = 0;
cur.b[0] = cur.b[1] = 0;
cur.step = 0;
vis[sx[0]][sy[0]][sx[1]][sy[1]] = 1;
q.push(cur);
while (!q.empty())
{
now = q.front();
q.pop();
for (i = 0; i < 4; i++)
{
cur = now;
//两个球
for (j = 0; j < 2; j++)
{
//如果进洞,则跳过
if (cur.b[j])continue;
cur.x[j] += dx[i];
cur.y[j] += dy[i];
if (mp[cur.x[j]][cur.y[j]] == '*')
{
cur.x[j] -= dx[i];
cur.y[j] -= dy[i];
}
}
//如果当前点走过或当前位置有小球就跳过
if (vis[cur.x[0]][cur.y[0]][cur.x[1]][cur.y[1]] || cur.x[0] == cur.x[1] && cur.y[0] == cur.y[1] && cur.b[0] + cur.b[1] == 0)continue;
cur.step++;
vis[cur.x[0]][cur.y[0]][cur.x[1]][cur.y[1]] = 1;
flag = 1;
for (j = 0; j < 2; j++) {
t = mp[cur.x[j]][cur.y[j]];
//t<2说明当前为洞,!cur.h[t]说明当前的洞没有被填上
if (t < 2 && !cur.h[t])cur.b[j] = 1, cur.h[t] = 1;
//只要有一个洞没被添上flag就等于0
if (!cur.b[j])flag = 0;
}
//两个洞都被添上
if (flag)
{
ans = cur.step;
return true;
}
q.push(cur);
}
}
return false;
}
int main() {
int i, j, t, cnt1, cnt2;
cin >> t;
while (t--)
{
cin >> n >> m;
cnt1 = cnt2 = 0;
for (i = 1; i <= n; i++)
{
cin >> s;
for (j = 1; j <= m; j++)
{
mp[i][j] = s[j - 1];
//洞用小球代替
if (mp[i][j] == 'H')mp[i][j] = cnt1++;
else if (mp[i][j] == 'B')sx[cnt2] = i, sy[cnt2] = j, cnt2++;
}
}
if (bfs())cout << ans << endl;
else cout << "Sorry , sir , my poor program fails to get an answer." << endl;
}
return 0;
}