hdu 1047 Image Perimeters
来源:互联网 发布:企业电话查询软件 编辑:程序博客网 时间:2024/06/11 09:34
Description
Technicians in a pathology lab analyze digitized images of slides. Objects on a slide are selected for analysis by a mouse click on the object. The perimeter of the boundary of an object is one useful measure. Your task is to determine this perimeter for selected objects.
The digitized slides will be represented by a rectangular grid of periods, '.', indicating empty space, and the capital letter 'X', indicating part of an object. Simple examples are
An X in a grid square indicates that the entire grid square, including its boundaries, lies in some object. The X in the center of the grid below is adjacent to the X in any of the 8 positions around it. The grid squares for any two adjacent X's overlap on an edge or corner, so they are connected.
XXX
XXX Central X and adjacent X's
XXX
An object consists of the grid squares of all X's that can be linked to one another through a sequence of adjacent X's. In Grid 1, the whole grid is filled by one object. In Grid 2 there are two objects. One object contains only the lower left grid square. The remaining X's belong to the other object.
The technician will always click on an X, selecting the object containing that X. The coordinates of the click are recorded. Rows and columns are numbered starting from 1 in the upper left hand corner. The technician could select the object in Grid 1 by clicking on row 2 and column 2. The larger object in Grid 2 could be selected by clicking on row 2, column 3. The click could not be on row 4, column 3.
One useful statistic is the perimeter of the object. Assume each X corresponds to a square one unit on each side. Hence the object in Grid 1 has perimeter 8 (2 on each of four sides). The perimeter for the larger object in Grid 2 is illustrated in the figure at the left. The length is 18.
Objects will not contain any totally enclosed holes, so the leftmost grid patterns shown below could NOT appear. The variations on the right could appear:
The input will contain one or more grids. Each grid is preceded by a line containing the number of rows and columns in the grid and the row and column of the mouse click. All numbers are in the range 1-20. The rows of the grid follow, starting on the next line, consisting of '.' and 'X' characters.
The end of the input is indicated by a line containing four zeros. The numbers on any one line are separated by blanks. The grid rows contain no blanks.
For each grid in the input, the output contains a single line with the perimeter of the specified object.
Example input:
2 2 2 2
XX
XX
6 4 2 3
.XXX
.XXX
.XXX
...X
..X.
X...
5 6 1 3
.XXXX.
X....X
..XX.X
.X...X
..XXX.
7 7 2 6
XXXXXXX
XX...XX
X..X..X
X..X...
X..X..X
X.....X
XXXXXXX
7 7 4 4
XXXXXXX
XX...XX
X..X..X
X..X...
X..X..X
X.....X
XXXXXXX
0 0 0 0
Example output:
8
18
40
48
8
Source
#include <iostream>#include <cstring>#include <cstdio>#include <vector>#include <algorithm>#include <math.h>using namespace std;#define maxn 150int n,m,xx,yy;int dx[]={0,0,1,-1,-1,1,-1,1};int dy[]={1,-1,0,0,-1,1,1,-1};char s[maxn][maxn];int vis[maxn][maxn];int ans;bool check(int x,int y){ if(x>=n || x<0 ||y>=m || y<0) return 0; return 1;}void dfs(int x,int y){ ans+=4; for(int i=0;i<4;i++) { int xx=x+dx[i]; int yy=y+dy[i]; if(check(xx,yy) && s[xx][yy]=='X') ans--; } vis[x][y]=1; for(int i=0;i<8;i++) { int xx=x+dx[i]; int yy=y+dy[i]; if(check(xx,yy) && s[xx][yy]=='X' && !vis[xx][yy]) { dfs(xx,yy); } }}int main(){ while(~scanf("%d%d%d%d",&n,&m,&xx,&yy)) { if(n==0 && m==0 && xx==0 && yy==0) break; ans=0; memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) scanf("%s",s[i]); dfs(xx-1,yy-1); cout<<ans<<endl; } return 0;}
- hdu 1047 Image Perimeters
- ZOJ 1047 Image Perimeters
- ZOJ 1047 Image Perimeters
- ZOJ 1047 Image Perimeters
- ZOJ 1047 Image Perimeters
- ZOJ - 1047 Image Perimeters
- ZOJ 1047 Image Perimeters
- ZOJ 1047 Image Perimeters
- ZOJ 1047Image Perimeters (BFS)
- ZOJ 1047 Image Perimeters (dfs)
- Image Perimeters
- Image Perimeters
- Image Perimeters
- poj 1111||zoj 1047 Image Perimeters(dfs)
- zoj 1047 Image Perimeters
- 深度优先搜索-ZOJ 1047 Image Perimeters
- ZOJ 1047 Image Perimeters(dfs+技巧)
- ZOJ 1047 Image Perimeters(BFS搜索)
- 图形字符命令banner
- 回调函数的好处
- Java之文件追加内容工具类
- STL:transform
- ViewPager的pageradapter加载视图的机制
- hdu 1047 Image Perimeters
- java读取文本编码问题
- android事件分发流程
- 底部弹出框
- JSON.parse()和JSON.stringify()
- 使用递归进行插入排序
- 有容云AppSoar容器健康检查与调度策略
- 使程序在Linux下后台运行 (关掉终端继续让程序运行的方法)
- Reverse Vowels of a String 交换元音字母