[ACM]POJ1979 Red and Black

最新推荐文章于 2019-07-27 14:57:38 发布

最新推荐文章于 2019-07-27 14:57:38 发布 · 96 阅读

本文介绍了一种基于回溯法的迷宫寻路算法，通过分析一个由黑色和红色方块组成的矩形房间，实现从指定起点出发遍历所有可达黑色方块的功能。该算法可用于解决类似贪吃蛇游戏中的路径探索问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目来源：北京大学POJhttp://poj.org/problem?id=1979

Description

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
The end of the input is indicated by a line consisting of two zeros.

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).

Sample Input

6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0

Sample Output

这个题目可以用回溯法解决，跟我博客里面的“贪吃蛇游戏”有些类似，见代码：

// RedAndBlack.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include <stdio.h> #include <string.h> char matrix[20][20]; int path = 0; int rows; int cols; void search(int m, int n) { if (m >= 0 && n >= 0 && m < rows && n < cols && (matrix[m][n] == '@' || matrix[m][n] == '.' ) ) { path++; matrix[m][n] = '0'; search(m,n+1); search(m+1,n); search(m-1,n); search(m,n-1); } } int main() { int i,j,m,n; //freopen("in.txt","r",stdin); while(1) { memset(matrix,'\0',20*20); path = 0; scanf("%d %d\n",&cols,&rows); if (cols == 0) break; for (i = 0; i < rows; i++) for (j = 0; j < cols; j++) { scanf("%c ",&matrix[i][j]); if (matrix[i][j] == '@') { m = i; n = j; } } search(m,n); printf("%d\n",path); } return 0; }