ZOJ 1047 Image Perimeters(dfs+技巧)
来源:互联网 发布:网店数据营销策略 编辑:程序博客网 时间:2024/06/04 18:35
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
【题解】
题目很长,但是题意简单,求给定连通块的周长。
但是说到底就是个dfs的题,不过在处理周长的时候注意下,可以判断如果它周围有一个未标记的点,那么它就有一条边,两个三个或者四个也一样,还要注意标记点周围区域外的也算,也要加进去,这样就可以直接得出边界长度和。
【AC代码】
#include<algorithm>#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<vector>#include<deque>using namespace std;#define lson k*2#define rson k*2+1#define M (t[k].l+t[k].r)/2#define INF 1008611111int dirx[8]={0,0,-1,1,1,1,-1,-1};int diry[8]={-1,1,0,0,1,-1,1,-1};int p[25][25],n,m,x,y;char s[25][25];int len;void dfs(int xx,int yy){ int i; p[xx][yy]=1; int nx=xx,ny=yy; for(i=0;i<8;i++) { nx=dirx[i]+xx; ny=diry[i]+yy; if(nx>=0&&ny>=0&&nx<n&&ny<m&&s[nx][ny]!='.'&&!p[nx][ny]) { dfs(nx,ny); } }}int main(){ int i,j,k,nx,ny; while(scanf("%d%d%d%d",&n,&m,&x,&y)!=EOF) { if(n==0&&m==0&&x==0&&y==0) break; for(i=0;i<n;i++) { scanf("%s",s[i]); } memset(p,0,sizeof(p)); dfs(x-1,y-1); int sum=0; for(i=0;i<n;i++) { for(j=0;j<m;j++) { if(p[i][j]) { int ans=0; for(k=0;k<4;k++) { nx=i+dirx[k]; ny=j+diry[k]; if(nx<0||ny<0||nx>=n||ny>=m||!p[nx][ny]) { ans++; } } sum+=ans; } } } printf("%d\n",sum); } return 0;}
- ZOJ 1047 Image Perimeters(dfs+技巧)
- ZOJ 1047 Image Perimeters (dfs)
- zoj 1047 || poj 1111 Image Perimeters(DFS water~)
- poj 1111||zoj 1047 Image Perimeters(dfs)
- 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 1047 Image Perimeters(BFS搜索)
- ZOJ 1047Image Perimeters (BFS)
- POJ1111 Image Perimeters(dfs)
- zoj 1047 Image Perimeters
- 深度优先搜索-ZOJ 1047 Image Perimeters
- POJ 1111 Image Perimeters (DFS)
- poj 1111(Image Perimeters DFS)
- 莫名的空指针
- gdb调试多进程和多线程命令
- Pydev : 安装与配置说明(二)
- Linux命令-top命令详解
- Maven创建web项目pom.xml最基础的配置
- ZOJ 1047 Image Perimeters(dfs+技巧)
- C++四种类型转换
- <class 'suds.sax.text.Text'> 类型转换字符类型
- AFNetWorking源码之AFSecurityPolicy
- 计蒜客 管家的忠诚(二) 线段树
- TCP源端口选择算法与列维模型
- hdu_6124_打表_找规律
- Java数据结构04----循环链表、仿真链表
- MySQL修改登陆密码