B. Black Square

B. Black Square
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

简单模拟，这个模拟的还算是简单吧

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<stack>typedef long long LL;using namespace std;char a[111][111];int main(){    int n, m;    while (cin >> n >> m)    {        getchar();        for (int i = 0; i < n; i++)            gets(a[i]);        int minx = 111111, miny = 111111, maxx = -11111, maxy = -11111;        int f = 0;        for(int i=0;i<n;i++)            for (int j = 0; j < m; j++)            {                if (a[i][j] == 'B')                {                    f ++;                    if (i < minx) minx = i;                    if (i > maxx) maxx = i;                    if (j < miny) miny = j;                    if (j > maxy) maxy = j;                }            }    /*  cout << "max_x  " << maxx<<endl;        cout << "min_x    " << minx<<endl;        cout << "max_y   " << maxy<<endl;        cout << "min_y   " << miny << endl;*/    //  cout << f << endl;        int sx = maxx - minx+1;        int sy = maxy - miny+1;        int s = max(sx, sy);        int sum = 0;        if (!f) sum = 1;        else if (s > n || s > m) sum = -1;        else sum = s*s-f;        cout << sum << endl;;    }    return 0;}