Codeforces Round #192 (Div. 2) A. Cakeminator【二维字符数组/吃掉cake,并且是一行或者一列下去，但是该行/列必须没有草莓的存在】

A. Cakeminator

time limit per test

 1 second

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

You are given a rectangular cake, represented as an r × c grid. Each cell either has an evil strawberry, or is empty. For example, a 3 × 4cake may look as follows:

The cakeminator is going to eat the cake! Each time he eats, he chooses a row or a column that does not contain any evil strawberries and contains at least one cake cell that has not been eaten before, and eats all the cake cells there. He may decide to eat any number of times.

Please output the maximum number of cake cells that the cakeminator can eat.

Input

The first line contains two integers r and c (2 ≤ r, c ≤ 10), denoting the number of rows and the number of columns of the cake. The next r lines each contains c characters — the j-th character of the i-th line denotes the content of the cell at row i and column j, and is either one of these:

• '.' character denotes a cake cell with no evil strawberry;
• 'S' character denotes a cake cell with an evil strawberry.

Output

Output the maximum number of cake cells that the cakeminator can eat.

Examples

input

3 4
S...
....
..S.

output

8

Note

For the first example, one possible way to eat the maximum number of cake cells is as follows (perform 3 eats).

【题意】：有一个蛋糕妖怪，只能吃一行或一列上的所有蛋糕，如果某行/列有草莓，就不吃到草莓，问怪兽最多能吃多少蛋糕。

【分析】：设置行，列标记数组判断标记草莓所在行列，vis数组标记这个点吃过与否。

【代码】：

#include <bits/stdc++.h>

using namespace std;
const int maxn = 20;
int cnt;
int n,m,f;
char a[maxn][maxn];
int r[maxn],c[maxn],vis[maxn][maxn];//行标记，列标记，单位元标记
int main()
{
    cin>>n>>m;
    memset(r,0,sizeof(r));
    memset(c,0,sizeof(c));
    memset(vis,0,sizeof(vis));
    for(int i=0;i<n;i++)
    {
        scanf("%s",a[i]);
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(a[i][j]=='S')
            {
                r[i]=1;
                c[j]=1;
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        if(r[i]) continue;
        for(int j=0;j<m;j++)
        if(!vis[i][j])
        {
            cnt++;
            vis[i][j]=1;
        }
    }
    for(int j=0;j<m;j++)
    {
        if(c[j]) continue;
        for(int i=0;i<n;i++)
        {
            if(!vis[i][j])
            {
                cnt++;
                vis[i][j]=1;
            }
        }
    }
    cout<<cnt<<endl;
    return 0;
}