FWT模板

代码来自51nod1570

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MN 501
using namespace std;

int read_p,read_ca;
inline int read(){
    read_p=;read_ca=getchar();
    while(read_ca<''||read_ca>'') read_ca=getchar();
    while(read_ca>=''&&read_ca<='') read_p=read_p*+read_ca-,read_ca=getchar();
    return read_p;
}
const int MOD=1e9+,N2=(MOD+)/;
int n,m,MMH=,Mavis=,_Mavis=,mmh[MN][(<<)+],ro,num=,a[(<<)+],b[(<<)+];
char s[MN];
inline void M(int &x){while(x>=MOD)x-=MOD;while(x<)x+=MOD;}
void work(int p,bool b,int mmh[]){
    int s=;
    for (int i=;i<;i++) s|=(((i>>p)&)^b)<<i;
    mmh[s]++;
}
inline void FWT_x(int N,int a[]){
    for (int i=;i<=N;i<<=)
    for (int m=i>>,j=;j<N;j+=i)
    for (int k=;k<m;k++) M(a[j+k]+=a[j+k+m]),M(a[j+k+m]=a[j+k]-*a[j+k+m]);
}
inline void IFWT_x(int N,int a[]){
    for (int i=;i<=N;i<<=)
    for (int m=i>>,j=;j<N;j+=i)
    for (int k=;k<m;k++){
        int A=a[j+k],B=a[j+k+m];
        a[j+k]=1LL*(A+B)*N2%MOD;
        a[j+k+m]=1LL*(A+MOD-B)*N2%MOD;
    }
}
inline void FWT_a(int N,int a[]){
    for (int i=;i<=N;i<<=)
    for (int m=i>>,j=;j<N;j+=i)
    for (int k=;k<m;k++) M(a[j+k]+=a[j+k+m]);
}
inline void IFWT_a(int N,int a[]){
    for (int i=;i<=N;i<<=)
    for (int m=i>>,j=;j<N;j+=i)
    for (int k=;k<m;k++) M(a[j+k]-=a[j+k+m]);
}
inline void FWT_o(int N,int a[]){
    for (int i=;i<=N;i<<=)
    for (int m=i>>,j=;j<N;j+=i)
    for (int k=;k<m;k++) M(a[j+k+m]+=a[j+k]);
}
inline void IFWT_o(int N,int a[]){
    for (int i=;i<=N;i<<=)
    for (int m=i>>,j=;j<N;j+=i)
    for (int k=;k<m;k++) M(a[j+k+m]-=a[j+k]);
}
void hb(int A[],int B[],int mmh[],bool kind){
    for (int i=;i<(<<);i++) a[i]=A[i],b[i]=B[i];
    if (kind){
        FWT_o(<<,a);FWT_o(<<,b);
        for (int i=;i<(<<);i++) a[i]=1LL*a[i]*b[i]%MOD;
        IFWT_o(<<,a);
        for (int i=;i<(<<);i++) M(mmh[i]+=a[i]);
    }else{
        FWT_a(<<,a);FWT_a(<<,b);
        for (int i=;i<(<<);i++) a[i]=1LL*a[i]*b[i]%MOD;
        IFWT_a(<<,a);
        for (int i=;i<(<<);i++) M(mmh[i]+=a[i]);
    }
}
int work(int l,int r){
    int p=++num,i,j;
    if (l==r){
        if (s[l]=='?') for (i=;i<;i++) work(i,,mmh[p]),work(i,,mmh[p]);else
        if (s[l]=='A') work(,,mmh[p]);else
        if (s[l]=='a') work(,,mmh[p]);else
        if (s[l]=='B') work(,,mmh[p]);else
        if (s[l]=='b') work(,,mmh[p]);else
        if (s[l]=='C') work(,,mmh[p]);else
        if (s[l]=='c') work(,,mmh[p]);else
        if (s[l]=='D') work(,,mmh[p]);else
        if (s[l]=='d') work(,,mmh[p]);
    }else{
        for (i=l,j=;;i++)
        if (j+=s[i]=='(',j-=s[i]==')',!j) break;
        i++;
        int L=work(l+,i-),R=work(i+,r-);
        if (s[i]=='&') hb(mmh[L],mmh[R],mmh[p],);else
        if (s[i]=='|') hb(mmh[L],mmh[R],mmh[p],);else
        hb(mmh[L],mmh[R],mmh[p],),hb(mmh[L],mmh[R],mmh[p],);
    }
    return p;
}
int main(){
    scanf("%s",s);
    ro=work(,strlen(s)-);
    n=read();
    for (int i=;i<=n;i++){
        int a=;
        a|=read();a|=read()<<;a|=read()<<;a|=read()<<;
        MMH|=<<a;Mavis|=read()<<a;
    }
    for (int i=;i<(<<);i++)
    if (!((i^Mavis)&MMH)) (_Mavis+=mmh[ro][i])%=MOD;
    printf("%d\n",_Mavis);
}