Codeforces Round #626 B. Count Subrectangles

B. Count Subrectangles

题意： 给定两个一维数组，数组中的每个元素非0即1，给你一个值k,问你在两数组相乘后的二维数组中有多少个面积为k的只包含1元素的矩阵。

思路：由于这个乘法的特殊性，我们可以知道最后的二维数组中的1元素是以矩阵的方式聚集的，一数组的连续1全1矩阵的长，另一数组的连续1为全1矩阵的宽，因此，我们可以用两个数组分别储存对应原数组的连续一长度，排序后求前缀和，最后对k的每个因子用公式求出该种情况下的矩阵有多少个，用二分查找加快效率。狗屁不通，详情看代码：

代码：

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 4e4+10;

int a[N], b[N], prea[N], preb[N];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n, m, k;
	int pos1=0, pos2=0;
	cin>>n>>m>>k;
	for(int i = 0,t,sum=0; i < n; ++i){
		cin>>t;
		if(t){
			++sum;
		}else{
			if(sum > 0)
				a[++pos1] = sum;
			sum = 0;
		}
		if(i==n-1&&sum>0) a[++pos1] = sum;
	}
	for(int i = 0,t,sum=0; i < m; ++i){
		cin>>t;
		if(t){
			++sum;
		}else{
			if(sum > 0)
				b[++pos2] = sum;
			sum = 0;
		}
		if(i==m-1&&sum>0) b[++pos2] = sum;
	}
	sort(a+1,a+pos1+1); sort(b+1,b+pos2+1);
	for(int i = 1; i <= pos1; ++i){
		prea[i] = prea[i-1]+a[i];
	}
	for(int i = 1; i <= pos2; ++i){
		preb[i] = preb[i-1]+b[i];
	}
	long long ans = 0;
	int t = sqrt(k);
	for(int i = 1; i <= t; ++i){
		if(k%i == 0){
			int pos11 = lower_bound(a+1,a+pos1+1,i)-a;
			int pos22 = lower_bound(b+1,b+pos2+1,k/i)-b;
			ans += (prea[pos1]-prea[pos11-1]-(pos1-pos11+1)*(i-1))*(preb[pos2]-preb[pos22-1]-(pos2-pos22+1)*(k/i-1));
			if(i*i == k) break;
			pos11 = lower_bound(a+1,a+pos1+1,k/i)-a;
			pos22 = lower_bound(b+1,b+pos2+1,i)-b;
			ans += (prea[pos1]-prea[pos11-1]-(pos1-pos11+1)*(k/i-1))*(preb[pos2]-preb[pos22-1]-(pos2-pos22+1)*(i-1));
		}
	}
	cout<<ans<<'\n';
	return 0;
}