UVA 12298 Super Poker II（FFT）
题意：
每个花色恰好选择一张牌
能够构成点数和大小为N的方案数
用类似生成函数的想法，多项式的幂值表示大小，前面的系数表示的是方案数
因此想到了多项式乘法，用FFT来优化
// whn6325689// Mr.Phoebe// http://blog.csdn.net/u013007900#include <algorithm>#include <iostream>#include <iomanip>#include <cstring>#include <climits>#include <complex>#include <fstream>#include <cassert>#include <cstdio>#include <bitset>#include <vector>#include <deque>#include <queue>#include <stack>#include <ctime>#include <set>#include <map>#include <cmath>#include <functional>#include <numeric>#pragma comment(linker, "/STACK:1024000000,1024000000")using namespace std;#define eps 1e-9#define PI acos(-1.0)#define INF 0x3f3f3f3f#define LLINF 1LL<<62#define speed std::ios::sync_with_stdio(false);typedef long long ll;typedef long double ld;typedef pair<ll, ll> pll;typedef complex<ld> point;typedef pair<int, int> pii;typedef pair<pii, int> piii;typedef vector<int> vi;#define CLR(x,y) memset(x,y,sizeof(x))#define CPY(x,y) memcpy(x,y,sizeof(x))#define clr(a,x,size) memset(a,x,sizeof(a[0])*(size))#define cpy(a,x,size) memcpy(a,x,sizeof(a[0])*(size))#define mp(x,y) make_pair(x,y)#define pb(x) push_back(x)#define lowbit(x) (x&(-x))#define MID(x,y) (x+((y-x)>>1))#define ls (idx<<1)#define rs (idx<<1|1)#define lson ls,l,mid#define rson rs,mid+1,r#define root 1,1,ntemplate<class T>inline bool read(T &n){T x = 0, tmp = 1;char c = getchar();while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();if(c == EOF) return false;if(c == '-') c = getchar(), tmp = -1;while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();n = x*tmp;return true;}template <class T>inline void write(T n){if(n < 0){putchar('-');n = -n;}int len = 0,data[20];while(n){data[len++] = n%10;n /= 10;}if(!len) data[len++] = 0;while(len--) putchar(data[len]+48);}//-----------------------------------const int MAXN=262144;const ld pi=acos(-1.0);struct Complex{ld r,i;Complex(){}Complex(ld r ,ld i):r(r),i(i) {}Complex operator + (const Complex& t) const{return Complex(r+t.r,i+t.i) ;}Complex operator - (const Complex& t) const{return Complex(r-t.r,i-t.i);}Complex operator * (const Complex& t) const{return Complex(r*t.r-i*t.i,r*t.i+i*t.r);}}s[MAXN],h[MAXN],c[MAXN],d[MAXN];int prime[30000],tot;bool isprime[50001];void FFT(Complex y[],int n,int rev)//rev=-1表示逆变换{for(int i=1,j,k,t; i<n; i++) //进行蝶型变换{for(j=0,k=n>>1,t=i; k; k>>=1,t>>=1) j=j<<1|t&1;if(i<j ) swap(y[i],y[j]);}for ( int s = 2 , ds = 1 ; s <= n ; ds = s , s <<= 1 ){Complex wn=Complex(cos(rev*2*pi/s),sin(rev*2*pi/s)),w=Complex(1,0),t;for(int k=0; k<ds; k++,w=w*wn){for(int i=k; i<n; i+=s){y[i+ds]=y[i]-(t=w*y[i+ds]);y[i]=y[i]+t;}}}if(rev==-1) for(int i=0; i<n; i++) y[i].r/=n;}void genPrime(int n){memset(isprime,true,sizeof isprime);for(int i=2; i<=n; ++i){if(isprime[i])prime[tot++]=i;for(int j=0; j<tot&&i*prime[j]<=n; ++j){isprime[i*prime[j]]=false;if(i%prime[j]==0) break;}}}int main(){int A,B,C;genPrime(50000);while(read(A)&&read(B)&&read(C)&&(A+B+C)){int L=1;while(L<=B) L<<=1;L<<=2;memset(s,0,sizeof s);memset(h,0,sizeof h);memset(c,0,sizeof c);memset(d,0,sizeof d);for(int i=0; i<B; ++i) if(!isprime[i]) s[i].r=1;for(int i=0; i<B; ++i) if(!isprime[i]) h[i].r=1;for(int i=0; i<B; ++i) if(!isprime[i]) c[i].r=1;for(int i=0; i<B; ++i) if(!isprime[i]) d[i].r=1;for(int i=0; i<C; ++i){char str[20];scanf("%s",str);int len=strlen(str),t;sscanf(str,"%d",&t);switch(str[len-1]){case 'S':s[t].r=0;break;case 'H':h[t].r=0;break;case 'C':c[t].r=0;break;case 'D':d[t].r=0;break;}}FFT(s,L,1);FFT(h,L,1);FFT(c,L,1);FFT(d,L,1);for(int i=0; i<L; ++i) h[i]=s[i]*h[i]*c[i]*d[i];FFT(h,L,-1);for(int i=A; i<=B; ++i) printf("%.0lf\n",fabs((double)h[i].r));putchar('\n');}return 0;}
深藏阁楼爱情的钟
刺骨的言语ヽ痛彻心扉
- 日理万妓
港控/mmm°
向右看齐
Myth丶恋晨
超、凢脫俗
还没有评论，来说两句吧...