题目描述:
雾.
题目分析:
Come from zyf2000
构造多项式.
首先1个的直接统计
将所有的数搞成一个生成函数,做一遍卷积搞出来选2个的答案
但是2个的存在选了两个相同的,或者选了一个排列,直接除2即可
然后生成函数卷两次统计选3个的答案
这里需要容斥一下,(选3个的答案-强行选了2个一样的*3+强行选了3个一样的*2)/6才是不考虑顺序、选不重复的3个的答案
强行选了3个一样的直接枚举,强行选了2个一样的就将每一个数的两倍搞成生成函数再和1的卷一下求出
用FFT加速
题目链接:
Ac 代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
const int maxm=300005;
const double PI=std::acos(-1);
struct complex{
double real,imag;
complex(){};
complex(double _real,double _imag):real(_real),imag(_imag){}
};
inline complex operator + (complex x,complex y)
{
return (complex){x.real+y.real,x.imag+y.imag};
}
inline complex operator - (complex x,complex y)
{
return (complex){x.real-y.real,x.imag-y.imag};
}
inline complex operator * (complex x,complex y)
{
return (complex){x.real*y.real-x.imag*y.imag,x.real*y.imag+x.imag*y.real};
}
inline complex operator * (complex x,double y)
{
return (complex){x.real*y,x.imag*y};
}
inline complex operator / (complex x,double y)
{
return (complex){x.real/y,x.imag/y};
}
complex A[maxm],B[maxm],C[maxm];
int rev[maxm],len;
inline void FFT(complex *a,int n,int f)
{
for(int i=0;i<n;i++) if(i<rev[i]) std::swap(a[i],a[rev[i]]);
for(int i=1;i<n;i<<=1)
{
complex wn=(complex){std::cos(PI/i),f*std::sin(PI/i)};
for(int j=0;j<n;j+=(i<<1))
{
complex w=(complex){1,0};
for(int k=0;k<i;k++,w=(w*wn))
{
complex x=a[j+k],y=a[i+j+k]*w;
a[j+k]=x+y,a[i+j+k]=x-y;
}
}
}
if(f==-1) for(int i=0;i<n;i++) a[i].real/=n;
}
int n,m,maxi;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
maxi=std::max(maxi,x);
A[x].real=B[2*x].real=C[3*x].real=1;
}
for(m=1;m<=3*maxi;m<<=1) len++;
for(int i=0;i<m;i++) rev[i]=((rev[i>>1]>>1)|((i&1)<<(len-1)));
FFT(A,m,1),FFT(B,m,1),FFT(C,m,1);
for(int i=0;i<m;i++)
A[i]=A[i]+(A[i]*A[i]-B[i])/2.0+(A[i]*A[i]*A[i]-A[i]*B[i]*3.0+C[i]*2.0)/6.0;
FFT(A,m,-1);
for(int i=0;i<m;i++)
if(round(A[i].real)) printf("%d %d\n",i,(int)round(A[i].real));
return 0;
}