Codeforces 828B Black Square【暴力枚举+二维前缀和】

B. Black Square

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so that all black cells form a square.

You are to determine the minimum possible number of cells needed to be painted black so that the black cells form a black square with sides parallel to the painting's sides. All the cells that do not belong to the square should be white. The square's side should have positive length.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 100) — the sizes of the sheet.

The next n lines contain m letters 'B' or 'W' each — the description of initial cells' colors. If a letter is 'B', then the corresponding cell is painted black, otherwise it is painted white.

Output

Print the minimum number of cells needed to be painted black so that the black cells form a black square with sides parallel to the painting's sides. All the cells that do not belong to the square should be white. If it is impossible, print -1.

Examples

Input

5 4
WWWW
WWWB
WWWB
WWBB
WWWW

Output

5

Input

1 2
BB

Output

-1

Input

3 3
WWW
WWW
WWW

Output

1

Note

In the first example it is needed to paint 5 cells — (2, 2), (2, 3), (3, 2), (3, 3) and (4, 2). Then there will be a square with side equal to three, and the upper left corner in (2, 2).

In the second example all the cells are painted black and form a rectangle, so it's impossible to get a square.

In the third example all cells are colored white, so it's sufficient to color any cell black.

题目大意：

给你一个只包含W和B两种颜色的N*M大小的矩阵，问最少可以使得多少个W变成B能够使得所有的B构成一个正方形。

如果不存在，输出-1.

思路：

O（nm）枚举左上角正方形的起点，然后O（len）枚举正方形边长，此时能够得到正方形的左上角和右下角，然后我们O（1）查询这个正方形中，是否能够包含原图形中所有的B.

如果可以，维护最小值，否则继续枚举。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
char a[150][150];
int sum[150][150];
int n,m;
void Get_sum()
{
    for(int i=1; i<=m; i++)
    {
        for(int j=1; j<=n; j++)
        {
            int tmp=0;
            if(a[j][i]=='B')tmp=1;
            sum[j][i]=sum[j-1][i]+tmp;
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            sum[i][j]+=sum[i][j-1];
        }
    }
}
int Getsum(int x,int y,int xx,int yy)
{
    return sum[xx][yy]-sum[x-1][yy]-sum[xx][y-1]+sum[x-1][y-1];
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        int output=0x3f3f3f3f;
        memset(sum,0,sizeof(sum));
        for(int i=1; i<=n; i++)scanf("%s",a[i]+1);
        int tot=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(a[i][j]=='B')tot++;
            }
        }
        Get_sum();
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                for(int len=0;len<=max(n,m);len++)
                {
                    int xx=i+len;
                    int yy=j+len;
                    if(xx>=1&&xx<=n&&yy>=1&&yy<=m)
                    {
                        if(Getsum(i,j,xx,yy)==tot)
                        {
                            output=min(output,(xx-i+1)*(yy-j+1)-tot);
                        }
                    }
                }
            }
        }
        if(output==0x3f3f3f3f)printf("-1\n");
        else
        printf("%d\n",output);
    }
}