题目:
思路:就是求数组a和数组c中有多少对(i,j),满足ai+cj==2*bk(k=1,2,3,..,nm)。将ai看作多项式的指数,num[ai]看作多项式的系数。FFT求多项式相乘,再计算答案,系数ai就是对应和为i的个数。
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 5e4+10;
const int M = 9e4+10;
const int base = 6e4;
const double PI = acos(-1.0);
struct Complex
{
double r,i;
Complex(double _r = 0,double _i = 0)
{
r = _r; i = _i;
}
Complex operator +(const Complex &b)
{
return Complex(r+b.r,i+b.i);
}
Complex operator -(const Complex &b)
{
return Complex(r-b.r,i-b.i);
}
Complex operator *(const Complex &b)
{
return Complex(r*b.r-i*b.i,r*b.i+i*b.r);
}
};
void change(Complex* y,int len)
{
int i,j,k;
for(i = 1, j = len/2;i < len-1;i++)
{
if(i < j)swap(y[i],y[j]);
k = len/2;
while( j >= k)
{
j -= k;
k /= 2;
}
if(j < k)j += k;
}
}
void fft(Complex* y,int len,int on)
{
change(y,len);
for(int h = 2;h <= len;h <<= 1)
{
Complex wn(cos(-on*2*PI/h),sin(-on*2*PI/h));
for(int j = 0;j < len;j += h)
{
Complex w(1,0);
for(int k = j;k < j+h/2;k++)
{
Complex u = y[k];
Complex t = w*y[k+h/2];
y[k] = u+t;
y[k+h/2] = u-t;
w = w*wn;
}
}
}
if(on == -1)
for(int i = 0;i < len;i++)
y[i].r /= len;
}
Complex x1[M<<2];
Complex x2[M<<2];
int nu,nm,nd,a[N],b[N],c[N];
int num1[M],num2[M];
long long num[M<<2];
int main(void){
int maxa=0,maxc=0;
scanf("%d",&nu);
for(int i=1;i<=nu;i++){
scanf("%d",&a[i]);
a[i]=a[i]+base;
maxa=max(maxa,a[i]);
num1[a[i]]++;
}
scanf("%d",&nm);
for(int i=1;i<=nm;i++){
scanf("%d",&b[i]);
b[i]=b[i]+base;
}
scanf("%d",&nd);
for(int i=1;i<=nd;i++){
scanf("%d",&c[i]);
c[i]=c[i]+base;
maxc=max(maxc,c[i]);
num2[c[i]]++;
}
maxa=max(maxa,maxc);
int len,len1;
len1=maxa+1;
len=1;
while(len < 2 * len1) len <<= 1;
for(int i = 0; i < len1; i++)
x1[i] = Complex(num1[i],0);
for(int i = len1; i < len; i++)
x1[i] = Complex(0,0);
for(int i = 0; i < len1; i++)
x2[i] = Complex(num2[i],0);
for(int i = len1; i < len; i++)
x2[i] = Complex(0,0);
fft(x1,len,1);
fft(x2,len,1);
for(int i = 0;i < len;i++)
x1[i] = (x1[i]*x2[i]);
fft(x1,len,-1);
for(int i = 0;i < len;i++)
num[i] = (long long)(x1[i].r+0.5);
ll ans=0;
for(int i=1;i<=nm;i++)
ans+=num[2*b[i]];
cout<<ans<<endl;
return 0;
}