Count Subrectangles_e - count subrectangles-CSDN博客

本文链接：https://blog.csdn.net/weixin_43901733/article/details/104898073

给定两个由0和1组成的数组a和b，构建矩阵c，其中c的每个元素是a和b对应位置的乘积。计算矩阵c中大小为k的全一子矩形的数量。输入包含矩阵的行数、列数和目标面积，输出符合条件的子矩形个数。题目提供样例解释了计算方法，可以通过分解k并检查a和b中的连续1段来找到答案。

摘要由CSDN通过智能技术生成

Count Subrectangles

You are given an array a of length $n$ and array $b$ of length $m$ both consisting of only integers 0 and 1. Consider a matrix $c$ of size $n \times m$ formed by following rule: $c i, j = a i \cdot b j$ $(i . e . a i$ multiplied by $b j$ ). It’s easy to see that $c$ consists of only zeroes and ones too.

How many subrectangles of size (area) $k$ consisting only of ones are there in $c$ ?

A subrectangle is an intersection of a consecutive (subsequent) segment of rows and a consecutive (subsequent) segment of columns. I.e.consider four integers $x 1, x 2, y 1, y 2 (1 \leq x 1 \leq x 2 \leq n, 1 \leq y 1 \leq y 2 \leq m)$ a subrectangle $c [x 1 \dots x 2] [y 1 \dots y 2]$ is an intersection of the rows $x 1, x 1 + 1, x 1 + 2, \dots, x 2$ and the columns $y 1, y 1 + 1, y 1 + 2, \dots, y 2$ .

The size (area) of a subrectangle is the total number of cells in it.

Input

The first line contains three integers $n, m$ and $k (1 \leq n, m \leq 40000, 1 \leq k \leq n \cdot m)$ , length of array $a$ , length of array $b$ and required size of subrectangles.

The second line contains $n$ integers $a 1, a 2, \dots, a n (0 \leq a i \leq 1)$ , elements of $a$ .

The third line contains $m$ integers $b 1, b 2, \dots, b m (0 \leq b i \leq 1)$ , elements of $b$ .

Output

Output single integer — the number of subrectangles of $c$ with size (area) $k$ consisting only of ones.

Examples
input
3 3 2
1 0 1
1 1 1
output
4
input
3 5 4
1 1 1
1 1 1 1 1
output
14

Note

In first example matrix $c$ is:
                                                  在这里插入图片描述
There are 4 subrectangles of size 2 consisting of only ones in it:

In second example matrix c is:

思路

题意：给出长度为n和m且大小只能为0或1的数组a和b，其中矩阵c为a和b的乘积，求矩阵c中有多少满足面积为k的由1组成的数量。
分析：首先数据范围为4e4,弄成矩阵来做不太现实= =，所以我们要分析最后矩阵c中那些为可构成的面积——a决定了每一列的数量，b决定每一行的数量，只有当a和b都为1的时矩阵c才为1。所以我们可以把k分解为k1*k2，只要满足数组a中1连续长度为k1和数组b中1连续长度为k2的情况，那么就有一个满足面积为k的情况~就分解k判断a或b中有多少满足连续长度即可了( $P s :$ 见代码好理解)

代码如下

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int mx=4e4+10;
int la[mx],lb[mx];//用来统计a和b数组中1的连续长度
int n,m,k,s;
ll ans;
 
int main()
{
	memset(la,0,sizeof(la));
	memset(lb,0,sizeof(lb));
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&s);
		if(s==1)
		la[i]=la[i-1]+1;//统计连续长度
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&s);
		if(s==1)
		lb[i]=lb[i-1]+1;
	}
	ans=0;
	for(int i=1;i<=n;i++)因为a数组长度为n，所以最大可能为n
	{
		if(k%i==0)//分解因数
		{
			int j=k/i;//j为b数组需要满足的长度
		    ll t1=0,t2=0;//分别统计满足的数量
		    for(int k=1;k<=n;k++)
		    {
		    	if(la[k]>=i)//大于等于就说明有一个满足
		    	t1++;
		    }
		    for(int k=1;k<=m;k++)
		    {
		    	if(lb[k]>=j)
		    	t2++;
		    }
		    ans+=t1*t2;//最后加上乘积即可
		}
	}
	printf("%lld\n",ans);
    return 0;
}