P5343 【XR-1】分块

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD=1e9+7;
int sum,pr,nf,num,tot;
ll dp[110],n;
bool used[110];
struct matrix{
    ll m[110][110];
    void clear(){
        memset(m,0,sizeof(m));
    }
}a,res;
matrix matMul(matrix m1,matrix m2){
    matrix ret;
    for(int i=1;i<=101;i++)
        for(int j=1;j<=101;j++){
            ret.m[i][j]=0;
            for(int k=1;k<=101;k++)
                ret.m[i][j]=(ret.m[i][j]+(m1.m[i][k]*m2.m[k][j])%MOD)%MOD;
        }
    return ret;
}
matrix ksm(matrix x,ll n){
    matrix ans;
    ans.clear();
    for(int i=1;i<=101;i++)
        ans.m[i][i]=1;
    while(n){
        if(n&1)ans=matMul(ans,x);
        x=matMul(x,x);
        n>>=1;
    }
    return ans;
}
int main(){
    cin>>n;
    cin>>pr;
    for(int i=1;i<=pr;i++){
        int x;
        scanf("%d",&x);
        used[x]=1;
    }
    cin>>nf;
    for(int i=1;i<=nf;i++){
        int x;
        scanf("%d",&x);
        if(used[x])a.m[1][x]=1;
    }
    for(int i=2;i<=100;++i)a.m[i][i-1]=1;
    res.m[0][1]=1;
    dp[0]=1;
    for(int i=1;i<=100;++i)
        for(int j=1;j<=i;++j)
            if(a.m[1][j])dp[i]=(dp[i]+dp[i-j])%MOD;
    for(int i=1;i<=100;++i)res.m[101-i][1]=dp[i];        
    if(n<=100)printf("%lld\n",res.m[101-n][1]);
    else {
        a=ksm(a,n-100);
        res=matMul(a,res);
        printf("%lld\n",res.m[1][1]);
    }
    return 0;
}