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

Source

Mid-Central USA 2001

一开始周长统计想了好久,后来发现旁边是空格就行。

还是很像swim..嗯

#include<iostream>
#include<cstring>
#include<queue>
#define MAXN 25
using namespace std; char a[MAXN][MAXN];
bool vis[MAXN][MAXN];
bool b[MAXN][MAXN][5];
int m,n,sx,sy; int dx[8]= {0,1,1,1,0,-1,-1,-1};
int dy[8]= {1,1,0,-1,-1,-1,0,1}; inline bool pd(int x,int y) {
if(x<1||x>m||y<1||y>n) return false;
return true;
} void dfs(int x,int y) {
if(!pd(x,y)) return;
a[x][y]='O';
for(int i=0; i<=7; i++) {
int nx=x+dx[i],ny=y+dy[i];
if(pd(nx,ny)) {
if(!vis[nx][ny]&&a[nx][ny]=='X') {
vis[nx][ny]=1;
dfs(nx,ny); }
}
}
} int calc() {
int i,j;
int cnt=0;
for(i=1; i<=m; i++) {
for(j=1; j<=n; j++) {
if(a[i][j]=='O') {
if(a[i+1][j]=='.'||a[i+1][j]==0) cnt++;
if(a[i-1][j]=='.'||a[i-1][j]==0) cnt++;
if(a[i][j+1]=='.'||a[i][j+1]==0) cnt++;
if(a[i][j-1]=='.'||a[i][j-1]==0) cnt++;
}
}
}
return cnt;
} int main() {
while(cin>>m>>n>>sx>>sy) {
if(m==0&&n==0&&sx==0&&sy==0) return 0;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(vis,0,sizeof(vis));
int i,j;
for(i=1; i<=m; i++) {
for(j=1; j<=n; j++) {
cin>>a[i][j];
}
}
dfs(sx,sy);
int ans=calc();
cout<<ans<<endl;
}
return 0;
}

[POJ]1111 Image Perimeters的更多相关文章

  1. POJ 1111(数字很吉利嘛) 简单BFS

    Image Perimeters Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8594 Accepted: 5145 Desc ...

  2. POJ 1111

    #include<iostream> #define MAXN 30 using namespace std; char _m[MAXN][MAXN]; bool mark[MAXN][M ...

  3. poj1111 DFS

    J - 搜索 Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:10000KB     64bit I ...

  4. POJ题目细究

    acm之pku题目分类 对ACM有兴趣的同学们可以看看 DP:  1011   NTA                 简单题  1013   Great Equipment     简单题  102 ...

  5. 【转】POJ百道水题列表

    以下是poj百道水题,新手可以考虑从这里刷起 搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight ...

  6. POJ 题目分类(转载)

    Log 2016-3-21 网上找的POJ分类,来源已经不清楚了.百度能百度到一大把.贴一份在博客上,鞭策自己刷题,不能偷懒!! 初期: 一.基本算法: (1)枚举. (poj1753,poj2965 ...

  7. POJ 3216 最小路径覆盖+floyd

    Repairing Company Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 6646   Accepted: 178 ...

  8. poj 题目分类(1)

    poj 题目分类 按照ac的代码长度分类(主要参考最短代码和自己写的代码) 短代码:0.01K--0.50K:中短代码:0.51K--1.00K:中等代码量:1.01K--2.00K:长代码:2.01 ...

  9. POJ题目分类(按初级\中级\高级等分类,有助于大家根据个人情况学习)

    本文来自:http://www.cppblog.com/snowshine09/archive/2011/08/02/152272.spx 多版本的POJ分类 流传最广的一种分类: 初期: 一.基本算 ...

随机推荐

  1. jq weui 滚动加载的坑

    1.一般情况下使用官网给个demo就可以了,如下: var loading = false; //状态标记 $(document.body).infinite().on("infinite& ...

  2. builder模式的新学习

    builder模式的新学习 静态工厂和构造器有个共同的局限性:他们不能很好的扩展到大量的可选参数.大多数产品在牧歌可选与中都会有非零的值 对于这种类,应该使用哪种构造器或者静态方法来进行编写?程序员一 ...

  3. 三维BFS Poj 2251

    #include <iostream> #include <cstdio> #include <string> #include <cstring> # ...

  4. Hive_Hive和数据仓库简介

    文章摘自 : http://www.imooc.com/video/7573 Hive是建立在Hadoop HDFS上的数据仓库基础架构.Hive可以用来进行数据的ETL.Hive定义了简单的类似SQ ...

  5. JavaScript特点、优缺点及常用框架

    参考来源:   http://www.cnblogs.com/SanMaoSpace/archive/2013/06/14/3136774.html

  6. ViewPager的使用总结

    这两天公司项目一直需要用到ViewPager来显示各式各样的Banner图,因而再次做了一些总结,不全后续应该还会更新的. 1.ViewPager要想做到一个界面显示多个items 有两种方式 ,一种 ...

  7. hdu 3686 Traffic Real Time Query System 点双两通分量 + LCA。这题有重边!!!

    http://acm.hdu.edu.cn/showproblem.php?pid=3686 我要把这题记录下来. 一直wa. 自己生成数据都是AC的.现在还是wa.留坑. 我感觉我现在倒下去床上就能 ...

  8. gulp-htmlone的BUG弃坑

    之前用项目用gulp-htmlone做最后的js和css内联打包出现各种问题 这次居然遇到打包后的css斜杠变反斜杠的问题 如下:/src/common/images/i_banner.jpg会被改成 ...

  9. tar打包压缩命令

    1. tar命令 用法: tar [选项...] [FILE]... GNU ‘tar’将许多文件一起保存至一个单独的磁带或磁盘归档,并能从归档中单独还原所需文件. 示例 tar -cf archiv ...

  10. drupal基本知识介绍

    2. Drupal 安装在安装Drupal前,你需要在服务器上先搭建一个PHP+MySQL环境.专业网站一般是安装LAMP(Linux+Apache+MySQL+PHP).环境的搭建可参考如下文章:  ...