UVA785 LA5281 Grid Colouring【DFS】

A set of contours is represented on a two dimensional grid as illustrated in the sample below. The contours are made of any printable character different than space and ‘’ (underscore). In the sample this character is ‘X’. All the other points of the grid are represented by spaces and marking characters.
A grid zone is defined as the set of points enclosed within a closed contour such that any two zone points can be connected by a path which does not cross any contour and whose segments run vertically or horizontally. A zone is marked if it contains identical characters, called marking characters, different than space and the character used to draw the grid contours. No zone can contain different marking characters. However, observe that while all the contours are drawn with the same character, the markings of different zones can be different. A zone is unmarked if it contains only spaces. Any grid zone can be either marked or unmarked and the marking characters can appear inside grid zones only.
Write a program to fill all the marked zones on each grid read from the input file. A marked zone is filled with its marking character, as shown in the sample.
Input
On input, each grid is terminated by a separation line full of underscores ‘’. There are at most 32 lines and at most 80 characters in a line for each grid. The lines can be of different length.
Output
The standard output file contains the painted grids. Each grid is output in the same format it is read from the input file, including the separation line, blank lines and possible leading or trailing spaces.
Sample Input

XXXXXXXXXXXXXXXXXXXX
X                 X                          X
X    #    #    XXXXXXXX     / X
X                 X                         X
XXXXXXXXXXXXXXXXXXXX
_____________________________
XXXXXXXXXXXX XXXXXX
X # XXX XXX X X
X XX X X X X
X X X XXXXXXX XXXXXXX
X XX X
X X XXXX XXXXXXXX
XX XXXX X X / X
X X X / X
XXXXXXXXXXXXX XXXXXXXX
_____________________________

Sample Output

XXXXXXXXXXXXXXXXXXXX
X######X///X
X######XXXXXXXXX
X#############XX
XXXXXXXXXXXXXXXXXXXX
_____________________________
XXXXXXXXXXXX XXXXXX
X###########XXX XXX X X
X##XX#########X X X X
X##X X##XXXXXXX XXXXXXX
X###XX###X
X#######X XXXX XXXXXXXX
XX#####XXXX##X X//X
X###########X X//X
XXXXXXXXXXXXX XXXXXXXX
_____________________________

问题链接：UVA785 LA5281 Grid Colouring
问题简述：（略）
问题分析：填充问题，用DFS来实现，需要注意边界的处理。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA785 LA5281 Grid Colouring */#include <bits/stdc++.h>using namespace std;const int R = 32, C = 80 + 1;
char m[R][C];
int r, vis[R][C];void dfs(int row, int col, char c)
{if(row < 0 || row >= r || col < 0) return;if (vis[row][col] || m[row][col] == 'X' || m[row][col] == '\0') return;m[row][col] = c;vis[row][col] = 1;dfs(row - 1, col, c);dfs(row + 1, col, c);dfs(row, col - 1, c);dfs(row, col + 1, c);
}int main()
{r = 0;while (gets(m[r])) {while (m[r][0] != '_')gets(m[++r]);memset(vis, 0, sizeof vis);for (int i = 0; i < r; i++)for (int j = 0; m[i][j]; j++)if (m[i][j] != ' ' && m[i][j] != 'X' && vis[i][j] == 0)dfs(i, j, m[i][j]);for (int i = 0; i <= r; i++)puts(m[i]);r = 0;}return 0;
}

UVA785 LA5281 Grid Colouring【DFS】相关推荐

NUC1158 Lake Counting【DFS】
Lake Counting 时间限制: 1000ms 内存限制: 65536KB 通过次数: 1总提交次数: 1 问题描述 Due to recent rains, water has pooled ...
Bailian2815 城堡问题【DFS】
2815:城堡问题总时间限制: 1000ms 内存限制: 65536kB 描述 1 2 3 4 5 6 7 ############################# 1 # | # | # | | ...
Bailian2816 红与黑【DFS】
2816:红与黑总时间限制: 1000ms 内存限制: 65536kB 描述有一间长方形的房子,地上铺了红色.黑色两种颜色的正方形瓷砖.你站在其中一块黑色的瓷砖上,只能向相邻的黑色瓷砖移动.请写一 ...
NUC1399 Sum It Up【DFS】
Sum It Up 时间限制: 1000ms 内存限制: 65535KB 通过次数: 1总提交次数: 1 问题描述 Given a specified total t and a list of n ...
[kuangbin]专题三 Dancing Links Squiggly Sudoku HDU - 4069【DFS】【精确覆盖】
[题目描述] Today we play a squiggly sudoku, The objective is to fill a 9*9 grid with digits so that each ...
NUC1333 Knight Moves【DFS】
Knight Moves 时间限制: 1000ms 内存限制: 65535KB 问题描述 A friend of you is doing research on the Traveling Knig ...
HDU1181 变形课【DFS】（废除）
新题解参见:HDU1181 变形课[DFS+关系闭包+bitset] 变形课 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 13107 ...
【DFS】巧妙取量的倒油问题
题目描述 [题目描述] 有三个容器,容量分别为 a,b,c(a> b > c ),一开始a装满油,现在问是否只靠abc三个容器量出k升油.如果能就输出"yes",并且 ...
【DFS】不撞南墙不回头—深度优先搜索算法[Deep First Search]
今天上午听到,那个非常6+1的李咏先生因癌症去世 DFS算法的基本模型深度下,不撞南墙不回头,就是一直往后找,知道没有路了,向后返回. 想起一首民谣,<可能否>--木小雅 https:/ ...

UVA785 LA5281 Grid Colouring【DFS】

UVA785 LA5281 Grid Colouring【DFS】相关推荐

最新文章

热门文章