https://ac.nowcoder.com/acm/contest/894/B
题意:给出数组a,b,矩阵c[i][j]=a[i]*b[j],问子矩阵和在L-R之间的个数;
反思:开始直接暴力~~,c[i][j]=a[i]*b[j]怎么看都是有作用的~很容易得出一个子矩阵的和就是对应a,b下标区间和的乘积所以先把a 的区间全部枚举出来,排序一下,在二分看b的区间中符合条件的个数。
#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back`
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=2e5+9;
const int mod=998244353;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
ll suma[1009],sumb[1009],a[1009],b[1009];
ll num[1009*1009];
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
int n,m;
ll L,R;
cin>>n>>m>>L>>R;
for(int i=1;i<=n;i++)
{
cin>>a[i];
suma[i]=suma[i-1]+a[i];
}
for(int i=1;i<=m;i++) cin>>b[i],sumb[i]=sumb[i-1]+b[i];
ll ans=0;
int cnt=0;
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
num[cnt++]=suma[j]-suma[i-1];
}
}
sort(num,num+cnt);
for(int i=1;i<=m;i++)
{
for(int j=i;j<=m;j++)
{
ll tmp=sumb[j]-sumb[i-1];
int l=upper_bound(num,num+cnt,(L-1)/(tmp))-num;
int r=upper_bound(num,num+cnt,R/(tmp))-num;
ans=ans+r-l;
}
}
cout<<ans<<endl;
return 0;
}