Image Perimeters(POJ)解题报告
来源:互联网 发布:pc屏幕同步软件 编辑:程序博客网 时间:2024/05/23 00:08
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.
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 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
XX Grid 1 .XXX Grid 2 XX .XXX .XXX ...X ..X. X...
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:
Impossible Possible XXXX XXXX XXXX XXXX X..X XXXX X... X... XX.X XXXX XX.X XX.X XXXX XXXX XXXX XX.X ..... ..... ..... ..... ..X.. ..X.. ..X.. ..X.. .X.X. .XXX. .X... ..... ..X.. ..X.. ..X.. ..X.. ..... ..... ..... .....
Input
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.
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.
Output
For each grid in the input, the output contains a single line with the perimeter of the specified object.
Sample Input
2 2 2 2XXXX6 4 2 3.XXX.XXX.XXX...X..X.X...5 6 1 3.XXXX.X....X..XX.X.X...X..XXX.7 7 2 6XXXXXXXXX...XXX..X..XX..X...X..X..XX.....XXXXXXXX7 7 4 4XXXXXXXXX...XXX..X..XX..X...X..X..XX.....XXXXXXXX0 0 0 0
Sample Output
81840488解题思路:这种很像是迷宫的,都是搜索 ,只要考虑到四个方向就可以了,一直找下去,找完为止,要考虑到出界的问题,要对他们进行处理,同时每走一遍就标记,当遇到“.”就验证一下是不是X的上下左右的,是的就周长加一,只是一些细节处理,比较简单。代码如下:
- #include<iostream>
- using namespace std;
- const int Max(21);
- int direction[]={-1,0,1}; //控制方向
- char map1[Max][Max];
- int map2[Max][Max];
- int count;
- int m,n,x,y;
- int Judge_Range(int a,int b) //判断是否出界
- {
- if(a>=1&&b>=1&&a<=m&&b<=n)
- return 1;
- return 0;
- }
- int Check_Data(int a, int b) //判断是不是上下左右的
- {
- if ((a * b == 1) || (a * b == -1))
- return 0;
- return 1;
- }
- void DP(int a,int b) //搜索
- {
- map2[a][b]=1;
- for(int i=0;i<=2;i++)
- for(int j=0;j<=2;j++)
- {
- if (Judge_Range(a+direction[i], b+direction[j]))
- {
- if (map1[a+direction[i]][b+direction[j]] == 'X' && !map2[a+direction[i]][b+direction[j]])
- DP(a+direction[i],b+direction[j]);
- if (map1[a+direction[i]][b+direction[j]] == '.' && Check_Data(direction[i], direction[j]))
- count++;
- }
- else if (Check_Data(direction[i], direction[j]))
- count++;
- }
- }
- int main()
- {
- cin>>m>>n>>x>>y;
- while(1)
- {
- count=0;
- if(m==0&&n==0&&x==0&&y==0)
- break;
- getchar();
- for(int i=1;i<=m;i++)
- for(int j=1;j<=n;j++)
- {
- cin>>map1[i][j];
- map2[i][j]=0;
- }
- DP(x,y);
- cout<<count<<endl;
- cin>>m>>n>>x>>y;
- }
- return 0;
- }
- Image Perimeters(POJ)解题报告
- POJ 1111 Image Perimeters (DFS)
- poj 1111(Image Perimeters DFS)
- POJ 1111 Image Perimeters(dfs)
- POJ 1111 Image Perimeters
- poj 1111 Image Perimeters
- POJ 1111 Image Perimeters
- Poj 1111 Image Perimeters
- POJ 1111 - Image Perimeters
- poj 1111 Image Perimeters
- POJ-1111-Image Perimeters
- poj 1111 Image Perimeters
- POJ 1111 Image Perimeters
- POJ:1111 Image Perimeters
- poj 1111:Image Perimeters
- POJ 1111 Image Perimeters
- POJ Image Perimeters 1111
- poj 1111 Image Perimeters
- 随便唠叨~
- nRF24L01高速嵌入式无线数传模块SPI_RW函数的理解
- 悼念512汶川大地震遇难同胞——老人是真饿了(杭电OJ2187)解题报告
- Max Sum(杭电OJ1003)解题报告
- 精美HTML5网站合集[zt]
- Image Perimeters(POJ)解题报告
- JSP简介
- GridView样式
- Multisim交互式地搭建电路原理
- 在我的相册里
- asp系列(一):request对象的Cookies集合调试错误
- 先了解了解DirectX
- javascript特效大全
- 寻找google免费企业邮箱的方法