题意
定义二元运算 opt 满足
现在给定一个长为 n 的数列 a 和一个长为 m 的数列 b ,接下来有 q 次询问。每次询问给定一个数字 c
你需要求出有多少对 (i, j) 使得 a_i opt b_j=c 。
1≤n,m,q,ai,bi≤50000
1
≤
n
,
m
,
q
,
a
i
,
b
i
≤
50000
分析
cdq分治,每次用FFT计算左边和右边分别对答案的贡献即可。
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
typedef long long LL;
const int N=100005;
const double pi=acos(-1);
int n,m,q,L,a[N],b[N],rev[N*2];
LL ans[N];
struct com
{
double x,y;
com operator + (const com &d) const {return (com){x+d.x,y+d.y};}
com operator - (const com &d) const {return (com){x-d.x,y-d.y};}
com operator * (const com &d) const {return (com){x*d.x-y*d.y,x*d.y+y*d.x};}
com operator / (const double &d) const {return (com){x/d,y/d};}
}s[N*2],t[N*2];
int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void FFT(com *a,int f)
{
for (int i=0;i<L;i++) if (i<rev[i]) std::swap(a[i],a[rev[i]]);
for (int i=1;i<L;i<<=1)
{
com wn=(com){cos(pi/i),f*sin(pi/i)};
for (int j=0;j<L;j+=(i<<1))
{
com w=(com){1,0};
for (int k=0;k<i;k++)
{
com u=a[j+k],v=a[j+k+i]*w;
a[j+k]=u+v;a[j+k+i]=u-v;
w=w*wn;
}
}
}
if (f==-1) for (int i=0;i<L;i++) a[i]=a[i]/L;
}
void solve(int l,int r)
{
if (l==r) {ans[0]+=(LL)a[l]*b[l];return;}
int mid=(l+r)/2,len=mid-l;
solve(l,mid);solve(mid+1,r);
int lg=0;
for (L=1;L<=r-l-1;L<<=1,lg++);
for (int i=0;i<L;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
for (int i=0;i<L;i++) s[i]=t[i]=(com){0,0};
for (int i=l;i<=mid;i++) s[i-l].x=a[i];
for (int i=mid+1;i<=r;i++) t[i-mid-1].x=b[i];
FFT(s,1);FFT(t,1);
for (int i=0;i<L;i++) s[i]=s[i]*t[i];
FFT(s,-1);
for (int i=0;i<=r-l-1;i++) ans[i+l+mid+1]+=(LL)(s[i].x+0.5);
for (int i=0;i<L;i++) s[i]=t[i]=(com){0,0};
for (int i=mid+1;i<=r;i++) s[i-mid-1].x=a[i];
for (int i=l;i<=mid;i++) t[len-(i-l)].x=b[i];
FFT(s,1);FFT(t,1);
for (int i=0;i<L;i++) s[i]=s[i]*t[i];
FFT(s,-1);
for (int i=-len;i<=r-mid-1;i++) ans[i+mid+1-l]+=(LL)(s[i+len].x+0.5);
}
int main()
{
int T=read();
while (T--)
{
n=read();m=read();q=read();int mx=0;
for (int i=1,x;i<=n;i++) x=read(),a[x]++,mx=std::max(mx,x);
for (int i=1,x;i<=m;i++) x=read(),b[x]++,mx=std::max(mx,x);
solve(0,mx);
while (q--)
{
int x=read();
printf("%lld\n",ans[x]);
}
for (int i=0;i<=mx*2;i++) ans[i]=a[i]=b[i]=0;
}
return 0;
}