zoj 3944

原创 2016年05月30日 11:39:38
Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Description

In a BG (dinner gathering) for ZJU ICPC team, the coaches wanted to count the number of people present at the BG. They did that by having the waitress take a photo for them. Everyone was in the photo and no one was completely blocked. Each person in the photo has the same posture. After some preprocessing, the photo was converted into a H×W character matrix, with the background represented by ".". Thus a person in this photo is represented by the diagram in the following three lines:

.O.
/|\
(.)

Given the character matrix, the coaches want you to count the number of people in the photo. Note that if someone is partly blocked in the photo, only part of the above diagram will be presented in the character matrix.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first contains two integers HW (1 ≤ HW ≤ 100) - as described above, followed by H lines, showing the matrix representation of the photo.

Output

For each test case, there should be a single line, containing an integer indicating the number of people from the photo.

Sample Input

2
3 3
.O.
/|\
(.)
3 4
OOO(
/|\\
()))

Sample Output

1
4

深搜思维,把一个器官周围的器官全部消去,类似于深搜的八连通问题,然而比赛时并没有联想到这一层

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char str[200][200];
void dfs1(int x, int y);
void dfs2(int x, int y);
void dfs3(int x, int y);
void dfs4(int x, int y);
void dfs5(int x, int y);
void dfs6(int x, int y);
int n, m;


int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        memset(str,0,sizeof(str));
        cin>>n>>m;
        for(int i=0;i<n;i++)
        {
            scanf(" %s",str[i]);
        }
        int cnt=0;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(str[i][j]=='O')
                {
                    cnt++;
                    dfs1(i,j);
                }
                else if(str[i][j]=='|')
                {
                    cnt++;
                    dfs2(i,j);
                }
                else if(str[i][j]=='/')
                {
                    cnt++;
                    dfs3(i,j);
                }
                else if(str[i][j]=='\\')
                {
                    cnt++;
                    dfs4(i,j);
                }
                else if(str[i][j]=='(')
                {
                    cnt++;
                    dfs5(i,j);
                }
                else if(str[i][j]==')')
                {
                    cnt++;
                    dfs6(i,j);
                }
            }
        }
        cout<<cnt<<endl;
    }
    return 0;
}


void dfs1(int x, int y)
{
    str[x][y]='.';
    if(x+1<n&&str[x+1][y]=='|')
    {
        str[x+1][y]='.';
    }
    if(x+1<n&&y-1>=0&&str[x+1][y-1]=='/')
    {
        str[x+1][y-1]='.';
    }
    if(x+1<n&&y+1<m&&str[x+1][y+1]=='\\')
    {
        str[x+1][y+1]='.';
    }
    if(x+2<n&&y-1>=0&&str[x+2][y-1]=='(')
    {
        str[x+2][y-1]='.';
    }
    if(x+2<n&&y+1<m&&str[x+2][y+1]==')')
    {
        str[x+2][y+1]='.';
    }
    return ;
}




void dfs2(int x, int y)
{
    str[x][y]='.';
    if(y+1<m&&str[x][y+1]=='\\')
    {
        str[x][y+1]='.';
    }
    if(x+1<n&&y-1>=0&&str[x+1][y-1]=='(')
    {
        str[x+1][y-1]='.';
    }
    if(x+1<n&&y+1<m&&str[x+1][y+1]==')')
    {
        str[x+1][y+1]='.';
    }
    return ;
}




void dfs3(int x, int y)
{
    str[x][y]='.';
    if(y+1<m&&str[x][y+1]=='|')
    {
        str[x][y+1]='.';
    }
    if(y+2<m&&str[x][y+2]=='\\')
    {
        str[x][y+2]='.';
    }
    if(x+1<n&&str[x+1][y]=='(')
    {
        str[x+1][y]='.';
    }
    if(x+1<n&&y+2<m&&str[x+1][y+2]==')')
    {
        str[x+1][y+2]='.';
    }
    return ;
}


void dfs4(int x, int y)
{
    str[x][y]='.';
    if(x+1<n&&y-2>=0&&str[x+1][y-2]=='(')
    {
        str[x+1][y-2]='.';
    }
    if(x+1<n&&str[x+1][y]==')')
    {
        str[x+1][y]='.';
    }
    return ;
}




void dfs5(int x, int y)
{
    str[x][y]='.';
    if(y+2<m&&str[x][y+2]==')')
    {
        str[x][y+2]='.';
    }
    return ;
}


void dfs6(int x, int y)
{
    str[x][y]='.';
    return ;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

ZOJ Problem Set - 3944(interesting people counting))

【链接】:click here~~ 【题意】: People CountingTime Limit: 2 Seconds Memory Limit: 65536 KB In a ...

zoj 3944 People Counting

In a BG (dinner gathering) for ZJU ICPC team, the coaches wanted to count the number of people prese...

ZOJ-3944 People Counting From 第13届浙江省赛

ZOJ-3944 People Counting Fr 第13届浙江省赛

[BZOJ3944]Sum(杜教筛)

题目描述传送门题解杜教筛裸题 我不会手写hash表… 讲解移步:http://blog.csdn.net/clove_unique/article/details/66991109代码#inclu...

[BZOJ3944]SUM 杜教筛

题意求∑ni=1μ(i)\sum_{i=1}^{n}\mu(i)和∑ni=1ϕ(i)\sum_{i=1}^{n}\phi(i)1. ∑ni=1∑d|iμ(i)=1=∑ni=1∑⌊ni⌋j=1μ(j)...
  • Coldef
  • Coldef
  • 2017年01月24日 15:44
  • 258

HDU 3944 DP?

DP? Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 128000/128000 K (Java/Others) Total Sub...

hdu3944 lucas定理+阶乘预处理

传送门 题意:  给出两个值n、m,求从杨辉三角上从上到下,只能向下或向右下,到位置(n,m)的和的最小值 思路:  画出杨辉三角很容易就可以发现,我们逆着看,若m 端,若m>n/2,则最小和在这个数...

hdu 3944 Lucas定理--大组合数取模 多校赛

题目:http://acm.hdu.edu.cn/showproblem.php?pid=3944 只需两步:1、从杨辉三角推公式,汗一下,高中会这个,但是大学只学了高数没学组合数学,于是呵...

hdu 3944 DP? 组合数学与数论的结合

原题连接:http://acm.hdu.edu.cn/showproblem.php?pid=3944 题目大意:求杨辉三角中从塔尖到n行k列所经过的路径中,虽经过数字之和最小的一条路 经过观察,...

HDU 3944解题报告

DP? Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 128000/128000 K (Java/Others) Total S...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:zoj 3944
举报原因:
原因补充:

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