ntt模板+hdu6589

就是实现了带取模fft的功能

const int G=3;//模数的原根
void init()
{
    ll L=0;
    m=n+m;for(n=1;n<=m;n<<=1) L++;
    FOR(i,0,n-1) R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
}
ll gmod(ll a,ll b){
    ll res=1;
    while(b)
    {
        if(b&1) res=1ll*res*a%mod;
        a=1ll*a*a%mod;b>>=1;
    }
    return res;
}
void NTT(ll* a,int f)
{
    FOR(i,0,n-1) if(i<R[i]) swap(a[i],a[R[i]]);
    for(int i=1;i<n;i<<=1){
        ll gn=gmod(G,(mod-1)/(i<<1));
        for(int j=0;j<n;j+=(i<<1)){
            ll g=1;
            for(int k=0;k<i;k++,g=1ll*g*gn%mod){
                ll x=a[j+k],y=1ll*g*a[j+k+i]%mod;
                a[j+k]=(x+y)%mod;a[j+k+i]=(x-y+mod)%mod;
            }
        }
    }
    if(f==1) return;
    ll nv=gmod(n,mod-2);reverse(a+1,a+n);
    FOR(i,0,n-1) a[i]=1ll*a[i]*nv%mod;
}

附带hdu6589的题:http://acm.hdu.edu.cn/showproblem.php?pid=6589

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <unordered_map>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-7
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
const int maxn=2e6+8;
ll R[maxn],n,m,a[maxn],cnt[4],zz,b[maxn],fac[maxn],inv[maxn],ans,tt;
void init()
{
    ll L=0;
    m=n+m;for(n=1;n<=m;n<<=1) L++;
    FOR(i,0,n-1) R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
}
ll gmod(ll a,ll b){
    ll res=1;
    while(b)
    {
        if(b&1) res=1ll*res*a%mod;
        a=1ll*a*a%mod;b>>=1;
    }
    return res;
}
void NTT(ll* a,int f)
{
    FOR(i,0,n-1) if(i<R[i]) swap(a[i],a[R[i]]);
    for(int i=1;i<n;i<<=1){
        ll gn=gmod(3,(mod-1)/(i<<1));
        for(int j=0;j<n;j+=(i<<1)){
            ll g=1;
            for(int k=0;k<i;k++,g=1ll*g*gn%mod){
                ll x=a[j+k],y=1ll*g*a[j+k+i]%mod;
                a[j+k]=(x+y)%mod;a[j+k+i]=(x-y+mod)%mod;
            }
        }
    }
    if(f==1) return;
    ll nv=gmod(n,mod-2);reverse(a+1,a+n);
    FOR(i,0,n-1) a[i]=1ll*a[i]*nv%mod;
}
void initt()
{
    fac[0]=fac[1]=1;
    for(int i=2;i<=2000000;i++)fac[i]=1ll*fac[i-1]*i%mod;
    inv[2000000]=gmod(fac[2000000],mod-2);
    for(int i=2000000-1;i>=0;i--) inv[i]=1ll*inv[i+1]*(i+1)%mod;
}
ll C(int n,int m)
{
    if(m>n) return 0;
    return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    initt();
    while(t--)
    {
        cin>>n>>m;ans=0;n--;
        FOR(i,0,n) sl(a[i]);
        REW(cnt,0);
        FOR(i,1,m) sl(zz),cnt[zz]++;
        zz=n,m=n;init();
        FOR(i,1,3)
        {
            if(!cnt[i]) continue;
            for(int j=0;j*i<=zz;j++) b[i*j]=C(cnt[i]+j-1,j);
            NTT(a,1);NTT(b,1);
            FOR(i,0,n-1) a[i]=1ll*a[i]*b[i]%mod;
            NTT(a,-1);NTT(b,-1);
            FOR(i,0,n+1) b[i]=0;
            FOR(i,zz+1,n+1) a[i]=0;
        }
        FOR(i,0,zz) ans^=(1ll*(i+1)*a[i]);
        cout<<ans<<endl;
    }
    return 0;
}