Codeforces Round #423 (Div. 2) B. Black Square(思路)
来源:互联网 发布:北京华贸广场caffe 编辑:程序博客网 时间:2024/05/17 10:07
题目:
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.
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.
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.
5 4WWWWWWWBWWWBWWBBWWWW
5
1 2BB
-1
3 3WWWWWWWWW
1
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.
给了一张n*m的图,W代表白色,B代表黑色,问的是在这张图中至少添加几个黑色可以在这张图中使黑色连成一个正方形。如果不能连成就输出-1
遍历这张图,然后找出横纵坐标的极值,然后算出来最大的差+1就是正方形的边长,我们只需要判断边长是不是越界,然后输出结果就好
代码:
#include <cstdio>#include <cstring>#include <string>#include <set>#include <iostream>#include <cmath>#include <stack>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define inf 0x3f3f3f3f#define mod 10000007#define debug() puts("what the fuck!!!")#define N (200000+50)#define ll long longusing namespace std;char map[110][110];int main(){int n,m,tot=0;int x1=inf,x2=0,y1=inf,y2=0;scanf("%d%d",&n,&m);for(int i=0; i<n; i++){scanf("%s",map[i]);for(int j=0; j<m; j++){if(map[i][j]=='B'){tot++;x1=min(x1,i);x2=max(x2,i);y1=min(y1,j);y2=max(y2,j);}}}if(!tot){puts("1");return 0;}int c=max(x2-x1,y2-y1)+1;if(c>n||c>m)puts("-1");elseprintf("%d\n",c*c-tot);return 0;}
- Codeforces Round #423 (Div. 2) B. Black Square(思路)
- Codeforces Round #423 (Div. 2) B. Black Square
- Codeforces #423-Div. 2-B. Black Square
- Codeforces Round #423 (Div. 2) B Black Square 黑色正方形 思维题
- Codeforces Round #423 B. Black Square
- Codeforces Round #423 B. Black Square
- Codeforces Round #247 (Div. 2)a.Black Square,b.Shower Line,c.k-Tree前三题
- Codeforces Round #122 (Div. 2) B. Square
- Codeforces Round #247 (Div. 2) - A. Black Square
- Codeforces Round #247(Div. 2) A. Black Square 水题
- Codeforces Round #369 (Div. 2) B. Chris and Magic Square
- Codeforces Round #369 (Div. 2) B. Chris and Magic Square
- Codeforces Round #369 (Div. 2)B. Chris and Magic Square
- Codeforces #247 (Div. 2) A. Black Square
- CodeForces 828B Black Square
- Codeforces 828 B Black Square
- 423B. Black Square
- 【Codeforces Round #369 (Div. 2)】Codeforces 711B Chris and Magic Square
- 算法题目---顺时针打印矩阵
- Android & iOS 开发全面对比分析
- 1293 球与切换器(dp)
- Kotlin-Kotlin中调用Java
- VMware中安装Centos
- Codeforces Round #423 (Div. 2) B. Black Square(思路)
- 4-1 简单输出整数 (10分)
- 盘点PDF文件转Word文档的四种高效率转换方法
- Maven3路程(五)用Maven创建Hibernate项目
- 支付概念条目
- 如何理解并正确使用MySql索引
- java 反射
- HTTPie 工具使用入门
- 什么时候析构函数需要定义为虚函数