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
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.
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 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
Sample Output
8
18
40
48
8
解题思路:这种很像是迷宫的,都是搜索 ,只要考虑到四个方向就可以了,一直找下去,找
完为止,要考虑到出界的问题,要对他们进行处理,同时每走一遍就标记,当遇到“.”就验证一下是
不是X的上下左右的,是的就周长加一,只是一些细节处理,比较简单。
代码如下:
-
#include<iostream>
-
usingnamespacestd;
-
-
constintMax(21);
-
intdirection[]={-1,0,1};
-
charmap1[Max][Max];
-
intmap2[Max][Max];
-
intcount;
-
intm,n,x,y;
-
-
intJudge_Range(inta,intb)
-
{
-
if(a>=1&&b>=1&&a<=m&&b<=n)
-
return1;
-
return0;
-
}
-
-
intCheck_Data(inta,intb)
-
{
-
if((a*b==1)||(a*b==-1))
-
return0;
-
return1;
-
}
-
-
voidDP(inta,intb)
-
{
-
map2[a][b]=1;
-
for(inti=0;i<=2;i++)
-
for(intj=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++;
-
}
-
elseif(Check_Data(direction[i],direction[j]))
-
count++;
-
}
-
}
-
-
-
-
-
-
-
intmain()
-
{
-
cin>>m>>n>>x>>y;
-
while(1)
-
{
-
count=0;
-
if(m==0&&n==0&&x==0&&y==0)
-
break;
-
getchar();
-
for(inti=1;i<=m;i++)
-
for(intj=1;j<=n;j++)
-
{
-
cin>>map1[i][j];
-
map2[i][j]=0;
-
}
-
DP(x,y);
-
cout<<count<<endl;
-
cin>>m>>n>>x>>y;
-
}
-
return0;
- }
分享到:
相关推荐
自己写的一些代码 Gnome Tetravex游戏 Image Perimeters operand提取指定的操作数 左右括号匹配解密 W's Cipher 倒水 踩气球 喝酒
This code helps you to do some calculus like areas and perimeters of some geometric figures lije circles, reclangles, etc. it uses visual C
YOU WILL NEED: Frame: T-Slot 2020 Aluminium Extrusion Profiles 4 x 420mm 6 x 380mm ...112pcs x M5 x 8mm button ...3 Perimeters 3 top/bottom layers 0.20mm layer height (or better) 50% infill PET-G
ZJU_Main 主页 下一页 ZJU 题型分类 文演整理版 2008-3-23 数论: 1007 Numerical Summation of a Series 简单题,还是蛮有意思的 1045 HangOver 简单题 ... 1049 I Think I Need a Houseboat 简单题 ...
ZJU 题型分类 ZJU_Main 主页 下一页 ZJU 题型分类 文演整理版 2008-3-23 数论: 1007 Numerical Summation of a Series 简单题,还是蛮有意思的 ... 1049 I Think I Need a Houseboat 简单题 ...
Nasuni Cloud File Services™ ...perimeters. This white paper explains how Nasuni works in private, hybrid, and public cloud configurations to meet the needs of the most security-conscious enterprises.
Master a new security paradigm for a world without traditional perimeters Gain visibility and control to secure compute, network, storage, and application workloads Incorporate Azure Security Center ...
Finally, we conclude by providing a holistic view of the IoT security stack and the anatomical details of IoT exploits while countering them with software defined perimeters and blockchains. ...
and apply the Pythagorean Theorem Polish up on polygons - get the lowdown on quadrilaterals and different polygons: their angles, areas, properties, perimeters, and far more Open the guide and...
Titelbild Titelbild Ivan S. Neretin, Konstantin A....sierten benzoiden Ring im Zentrum des fluorierten Perimeters. Die Bindungen dieses Hexagons sind alle gleich lang (1.372 �). Der nicht
Titelbild Titelbild Ivan S. Neretin, Konstantin A....sierten benzoiden Ring im Zentrum des fluorierten Perimeters. Die Bindungen dieses Hexagons sind alle gleich lang (1.372 �). Der nicht