题解:
分治fft我都不会……好弱啊……其实可以直接对值进行分治,这样的话就可以巧妙的解决要进行哪一个运算的问题。
代码:
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const double pi=acos(-1.0);
const int Maxn=500010;
const int inf=2147483647;
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<<3)+(x<<1)+(ch^48),ch=getchar();
return x*f;
}
struct C
{
double x,y;
C(double _x=0,double _y=0){x=_x,y=_y;}
}a[1050000],b[1050000];
C operator + (C a,C b){return C(a.x+b.x,a.y+b.y);}
C operator - (C a,C b){return C(a.x-b.x,a.y-b.y);}
C operator * (C a,C b){return C(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
int bin[1050000];
void fft(C *a,int n,int op)
{
for(int i=0;i<n;i++)
if(i<bin[i])swap(a[i],a[bin[i]]);
for(int i=1;i<n;i<<=1)
{
C wn=C(cos(pi/i),sin(pi/i)*op);
for(int j=0;j<n;j+=(i<<1))
{
C w=C(1,0);
for(int k=0;k<i;k++)
{
C t=a[i+j+k]*w;w=w*wn;
a[i+j+k]=a[j+k]-t;
a[j+k]=a[j+k]+t;
}
}
}
}
LL ans[Maxn<<1];
int A[Maxn],B[Maxn],n,m,q;
void solve(int l,int r)
{
if(l==r)
{
ans[0]+=(LL)A[l]*B[l];
return;
}
int mid=l+r>>1;
int t=1;
while(t<r-l)t<<=1;
bin[0]=0;
for(int i=0;i<=t;i++)
{
a[i]=b[i]=C(0,0);
if(i)bin[i]=((bin[i>>1]>>1)|((i&1)*(t>>1)));
}
for(int i=l;i<=mid;i++)a[i-l].x=A[i];
for(int i=mid+1;i<=r;i++)b[i-mid-1].x=B[i];
fft(a,t,1),fft(b,t,1);
for(int i=0;i<=t;i++)a[i]=a[i]*b[i];
fft(a,t,-1);
for(int i=0;i<r-l;i++)
{
LL tmp=(LL)(a[i].x/(double)t+0.5);
ans[i+l+mid+1]+=tmp;
}
for(int i=0;i<=t;i++)a[i]=b[i]=C(0,0);
for(int i=mid+1;i<=r;i++)a[i-mid-1].x=A[i];
for(int i=l;i<=mid;i++)b[mid-i].x=B[i];
fft(a,t,1),fft(b,t,1);
for(int i=0;i<=t;i++)a[i]=a[i]*b[i];
fft(a,t,-1);
for(int i=0;i<r-l;i++)
{
LL tmp=(LL)(a[i].x/(double)t+0.5);
ans[i+1]+=tmp;
}
solve(l,mid),solve(mid+1,r);
}
int main()
{
int T=read();
while(T--)
{
memset(A,0,sizeof(A));
memset(B,0,sizeof(B));
memset(ans,0,sizeof(ans));
n=read(),m=read(),q=read();
int mx=0;
for(int i=1;i<=n;i++)
{
int x=read();
mx=max(mx,x);A[x]++;
}
for(int i=1;i<=m;i++)
{
int x=read();
mx=max(mx,x);B[x]++;
}
solve(0,mx);
for(int i=1;i<=q;i++)printf("%lld\n",ans[read()]);
}
}