2021牛客暑期多校训练营1Determine the Photo Position

最新推荐文章于 2022-08-07 16:22:24 发布

Elicsyd

最新推荐文章于 2022-08-07 16:22:24 发布

阅读量117

点赞数

分类专栏：牛客多校

本文链接：https://blog.csdn.net/qq_49638570/article/details/118862392

版权

牛客多校专栏收录该内容

13 篇文章 0 订阅

订阅专栏

链接：https://ac.nowcoder.com/acm/contest/11166/D
来源：牛客网

题目描述

You have taken the graduation picture of graduates. The picture could be regarded as a matrix A of n×nn \times nn×n, each element in A is 0 or 1, representing a blank background or a student, respectively.

However, teachers are too busy to take photos with students and only took a group photo themselves. The photo could be regarded as a matrix B of 1×m1 \times m1×m where each element is 2 representing a teacher.

As a master of photoshop, your job is to put photo B into photo A with the following constraints:

you are not allowed to split, rotate or scale the picture, but only translation.
each element in matrix B should overlap with an element in A completely, and each teacher should overlap with a blank background, not shelter from a student.

Please calculate the possible ways that you can put photo B into photo A.

输入描述:

The first line contains two integers n,m(1≤n,m≤2000)n,m(1 \le n,m \le 2000)n,m(1≤n,m≤2000) indicating the size of photos A and B. 

In the next $n$ lines,each line contains n{n}n characters of '0' or '1',representing the matrix A.

The last line contains m{m}m characters of '2', representing matrix B.

输出描述:

Output one integer in a line, indicating the answer.

示例1

输入

输出

示例2

输入

输出

示例3

输入

输出

这个题目

只要求出超过2的个数的连续横向“0”的个数输出就是答案

#include<iostream>
using namespace std;
int main()
{
	int n,m;
	cin>>n>>m;
	string s;
	string k;
	int h;
	for(int i=0;i<n;i++)
	{
		cin>>s;
		int u=0;
		for(int j=0;j<n;j++)
		{
			if(s[j]=='0')
			{
				++u;
			}
			else
			{
				u=0;
			}
			if(u>=m)
			{
				h++;
			}
		}
		
	}
	cin>>k;
	cout<<h<<endl;
}