Count Subrectangles

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: $ci,j=ai\cdot bj$$(i.e.ai$ multiplied by $bj$). 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 $x1,x2,y1,y2(1\le x1\le x2\le n,1\le y1\le y2\le m)$ a subrectangle $c[x1\dots x2][y1\dots y2]$ is an intersection of the rows $x1,x1+1,x1+2,\dots ,x2$ and the columns $y1,y1+1,y1+2,\dots ,y2$.

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\le n,m\le 40000,1\le k\le n\cdot m)$, length of array $a$, length of array $b$ and required size of subrectangles.

The second line contains $n$ integers $a1,a2,\dots ,an(0\le ai\le 1)$, elements of $a$.

The third line contains $m$ integers $b1,b2,\dots ,bm(0\le bi\le 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中有多少满足连续长度即可了($Ps:$见代码好理解)

代码如下

#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;
}