L - Cakeminator

最新推荐文章于 2020-01-12 23:34:47 发布

原创最新推荐文章于 2020-01-12 23:34:47 发布 · 448 阅读

0 ·

CC 4.0 BY-SA版权

有点意思的简单题专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种算法问题，即如何最大化地消除不含邪恶草莓的蛋糕单元格。通过记录每行每列是否有邪恶草莓，避免重复计算交叉部分，最终得出蛋糕消消乐的最大得分。

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 × 4 cake may look as follows:

$\text{[math]}$

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.

Example

Input

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

Output

Note

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

$\text{[math]}$

题意：有草莓在的行或列就不能吃；

题解：先求得总方框数，再减去草莓所在得行和列有交点数；

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include<set>
#include <algorithm>
using namespace std;



int main()
{
    int r[11],c[11];
    memset(r,0,sizeof(r));memset(c,0,sizeof(c));
    int n,m;
    while(cin>>n>>m)
    {
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++)
            {
                char t;cin>>t;
                if(t=='S'){r[i]=c[j]=1;}
            }
        }
        int ans=n*m;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++){
                if(r[i]&&c[j])ans--; }
        }
        cout<<ans<<endl;
    }
    return 0;
}