A. Table

最新推荐文章于 2023-11-27 22:07:56 发布

小菜鸡加油

最新推荐文章于 2023-11-27 22:07:56 发布

阅读量311

点赞数

分类专栏：思维

本文链接：https://blog.csdn.net/zstuyyyyccccbbbb/article/details/107784119

版权

思维专栏收录该内容

514 篇文章 4 订阅

订阅专栏

Simon has a rectangular table consisting of n rows and m columns. Simon numbered the rows of the table from top to bottom starting from one and the columns — from left to right starting from one. We’ll represent the cell on the x-th row and the y-th column as a pair of numbers (x, y). The table corners are cells: (1, 1), (n, 1), (1, m), (n, m).

Simon thinks that some cells in this table are good. Besides, it’s known that no good cell is the corner of the table.

Initially, all cells of the table are colorless. Simon wants to color all cells of his table. In one move, he can choose any good cell of table (x 1, y 1), an arbitrary corner of the table (x 2, y 2) and color all cells of the table (p, q), which meet both inequations: min(x 1, x 2) ≤ p ≤ max(x 1, x 2), min(y 1, y 2) ≤ q ≤ max(y 1, y 2).

Help Simon! Find the minimum number of operations needed to color all cells of the table. Note that you can color one cell multiple times.Input

The first line contains exactly two integers n, m (3 ≤ n, m ≤ 50).

Next n lines contain the description of the table cells. Specifically, the i-th line contains m space-separated integers a i1, a i2, …, a im. If a ij equals zero, then cell (i, j) isn’t good. Otherwise a ij equals one. It is guaranteed that at least one cell is good. It is guaranteed that no good cell is a corner.Output

Print a single number — the minimum number of operations Simon needs to carry out his idea.ExamplesinputCopy

outputCopy

inputCopy

outputCopy

Note

In the first sample, the sequence of operations can be like this:

For the first time you need to choose cell (2, 2) and corner (1, 1).
For the second time you need to choose cell (2, 2) and corner (3, 3).
For the third time you need to choose cell (2, 2) and corner (3, 1).
For the fourth time you need to choose cell (2, 2) and corner (1, 3).

In the second sample the sequence of operations can be like this:

For the first time you need to choose cell (3, 1) and corner (4, 3).
For the second time you need to choose cell (2, 3) and corner (1, 1).

思路：发现在边缘但是不在四周端点的的时候要2次，在内部的要4次，在四周端点的1次

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100;
typedef long long LL;
LL a[maxn][maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,m;cin>>n>>m;
  for(LL i=1;i<=n;i++)
  	for(LL j=1;j<=m;j++)
  		cin>>a[i][j];	
  	if(a[1][1]||a[1][m]||a[n][1]||a[n][m])
  	{
  		cout<<"1"<<endl;return 0;	
	}
	int flag=1;
  	for(LL i=1;i<=n;i++)
	  	for(LL j=1;j<=m;j++)
		  {
			if(a[i][j]&&(i==1||i==n||j==1||j==m))
			{
				flag=0;
				cout<<"2"<<endl;return 0;
			}
		  }	
	cout<<"4"<<endl;	  
return 0;
}