ZOJ 1047 Image Perimeters

原创 2015年07月09日 19:38:39

Image Perimeters

Time Limit: 2 Seconds      Memory Limit: 65536 KB

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


题意:告诉n*m的图形,告诉起始点a,b以(a,b)为起点八个方向找联通块,求联通快周长。

思路:搜索来一层层找联通快,对于每个X,起始周长是4,如果X上下左右四个方向有X,那么周长就减一。

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#define N 55
using namespace std;

char s[N][N];
int n,m;
int a,b;
int dis[8][2]={0,1,0,-1,1,0,-1,0,-1,-1,-1,1,1,-1,1,1};
int vis[N][N];
int ans;

void dfs(int x,int y)
{
    int cnt=4;
    if(vis[x][y]) return;
    vis[x][y]=1;
    for(int i=0;i<8;i++)
    {
        int xx=x+dis[i][0];
        int yy=y+dis[i][1];

        if(xx<0||yy<0||xx>=n||yy>=m) continue;

        if(s[xx][yy]!='X') continue;

        dfs(xx,yy);
        if(dis[i][0]==0 || dis[i][1]==0) cnt--;
    }
    ans+=cnt;

}

int main()
{
    while(~scanf("%d%d%d%d",&n,&m,&a,&b))
    {
        if(n+m+a+b==0) break;
        a--;b--;

        memset(vis,0,sizeof vis);
        for(int i=0;i<n;i++)
        {
            scanf("%s",s[i]);
        }
        ans=0;
       if(s[a][b]=='X') dfs(a,b);
        printf("%d\n",ans);

    }
    return 0;
}







POJ_1111_Image Perimeters【DFS】

/* Image Perimeters Time Limit: 1000MS        Memory Limit: 10000K Total Submissions: 9089        Ac...
  • huangshuai147
  • huangshuai147
  • 2017年04月17日 11:00
  • 215

POJ 1111 Image Perimeters 简单DFS

http://poj.org/problem?id=1111 Image PerimetersTime Limit: 1000MS Memory Limit: 10000KDescriptionTec...
  • yming0221
  • yming0221
  • 2011年01月18日 20:19
  • 1505

poj 1111 dfs 求周长

题意:给你一个图形,让你求周长。 思想:首先把这个图存一遍,然后吧一圈都置为 . ,一旦搜索到边上就加一。 #include #include char map[2...
  • qq_35736364
  • qq_35736364
  • 2017年04月20日 21:49
  • 80

ZOJ 1047 Image Perimeters

Image Perimeters Time Limit: 2 Seconds      Memory Limit: 65536 KB Technicians in a patholog...
  • wust_ZJX
  • wust_ZJX
  • 2015年07月09日 19:38
  • 486

ZOJ 1047 Image Perimeters

Image PerimetersTime Limit: 1 Second      Memory Limit: 32768 KB Technicians in a pathology lab anal...
  • snowy827719
  • snowy827719
  • 2009年08月08日 23:21
  • 468

ZOJ 1047 Image Perimeters

大意:给出一张有“.”和“X”组成的图,给出点击位置s,t。求由s,t以及附近不包含”.”的由”X”组成的联通图的周长。 做法:很容易发现,当一个“X”上下左右四个位置没有“X”的时候就会有边,因此...
  • youthinkwu
  • youthinkwu
  • 2015年02月17日 11:26
  • 137

f-06

Description Technicians in a pathology lab analyze digitized images of slides. Objects on a sli...
  • lqyzb20164313
  • lqyzb20164313
  • 2017年06月18日 09:26
  • 59

ZOJ 1047 Image Perimeters

题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=47 代码: /*  * 1002.cpp  *  *...
  • S031302306
  • S031302306
  • 2015年11月24日 14:04
  • 132

ZOJ - 1047 Image Perimeters

Image Perimeters Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu S...
  • acm_1361677193
  • acm_1361677193
  • 2015年08月01日 12:50
  • 126

深度优先搜索-ZOJ 1047 Image Perimeters

大致题意给你一张图,图上有‘X’和‘.’。‘X’可以八个方向连通,这些连起来的‘X’成为一个块。问:输入一个坐标,这个坐标所在的块的周长是多少。 如图: 分析1、使用上下左右和对角线方向的深度优先...
  • Double2hao
  • Double2hao
  • 2016年06月19日 10:41
  • 1108
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:ZOJ 1047 Image Perimeters
举报原因:
原因补充:

(最多只允许输入30个字)