[FFT 模板题] UOJ #34 多项式乘法

主要就是想看看自己能写的多快 结果并不快

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef double ld;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void write(int x) {
  if (!x) return (void)puts("0");
  static short s[12],t;
  while (x) s[++t]=x%10,x/=10; while (t) putchar('0'+s[t--]);
  putchar(' ');
}
struct E{
  ld real,imag;  
  E(ld real=0,ld imag=0):real(real) , imag(imag) { }
  void operator /=(ld a){ real/=a; imag/=a; }
  friend E operator+(E&a,E&b){ return E(a.real+b.real,a.imag+b.imag); }  
  friend E operator-(E&a,E&b){ return E(a.real-b.real,a.imag-b.imag); }  
  friend E operator*(E&a,E&b){ return E(a.real*b.real-a.imag*b.imag,a.imag*b.real+a.real*b.imag); }  
};
const ld PI=acos(-1.0);
const int N=270005;

int num;
E w[2][N];

inline void Pre(int n){
  num=n;
  E g(cos(2*PI/num),sin(2*PI/num));
  w[1][0]=w[0][0]=E(1,0); for (int i=1;i<num;i++) w[1][i]=w[1][i-1]*g;
  for (int i=1;i<num;i++) w[0][i]=w[1][num-i];
}
int R[N];
inline void FFT(E *a,int n,int r,E *w){
  for (int i=0;i<n;i++) if (R[i]>i) swap(a[i],a[R[i]]);
  for (int i=1;i<n;i<<=1)
    for (int j=0;j<n;j+=(i<<1))
      for (int k=0;k<i;k++){
    E x=a[j+k],y=a[j+k+i]*w[num/(i<<1)*k];
    a[j+k]=x+y; a[j+k+i]=x-y;
      }
  if (!r) for (int i=0;i<n;i++) a[i]/=n;
}

int n1,n2,m,L;
int a1[N],a2[N];
E A[N],B[N];

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n1); read(n2);
  for (int i=0;i<=n1;i++) read(a1[i]);
  for (int i=0;i<=n2;i++) read(a2[i]);
  for (m=1,L=-1;m<=n1+n2;m<<=1,L++); Pre(m);
  for (int i=0;i<m;i++) A[i]=E(a1[i]+a2[i],a1[i]-a2[i]);
  for (int i=1;i<m;i++) R[i]=(R[i>>1]>>1)|((i&1)<<L);
  FFT(A,m,1,w[1]);
  for (int i=0;i<m;i++) A[i]=A[i]*A[i];
  FFT(A,m,0,w[0]);
  for (int i=0;i<=n1+n2;i++) write((int)(A[i].real/4+0.1));
  return 0;
}