4513: [Sdoi2016]储能表 数位DP

 1 #include<cstdio>
 2 #include<algorithm> 
 3 #include<cstring>
 4 typedef long long int lli;
 5 const int maxn=1e2+1e1;
 6 
 7 lli f[maxn][2][2][2],g[maxn][2][2][2]; // f is sum , g is count .
 8 int ba[maxn],bb[maxn],bc[maxn],mod;
 9 
10 inline void dfs(int bit,int la,int lb,int lc) { // bit is the bit that we are determining in range [1,64] .
11     if( ~f[bit][la][lb][lc] ) return;
12     if( !bit ) {
13         f[bit][la][lb][lc] = 0 , g[bit][la][lb][lc] = 1;
14         return;
15     } int lima = !la || ba[bit] , limb = !lb || bb[bit] , limc = lc && bc[bit];
16     f[bit][la][lb][lc] = g[bit][la][lb][lc] = 0;
17     for(int i=0;i<=lima;i++) for(int j=0;j<=limb;j++) if( ( i ^ j ) >= limc ) {
18         int ta = la&&i==lima , tb = lb&&j==limb , tc = lc&&(i^j)==limc;
19         dfs(bit-1,ta,tb,tc);
20         g[bit][la][lb][lc] = ( g[bit][la][lb][lc] + g[bit-1][ta][tb][tc] ) % mod ,
21         f[bit][la][lb][lc] = ( f[bit][la][lb][lc] + f[bit-1][ta][tb][tc] + ( (lli) ( i ^ j ) << ( bit -  1 ) ) % mod * g[bit-1][ta][tb][tc] % mod ) % mod;
22     }
23 }
24 
25 inline int cutbit(lli t,int* dst) {
26     int ret = 0; memset(dst,0,sizeof(int)*maxn);
27     while(t) dst[++ret] = t & 1 , t >>= 1;
28     return ret;
29 }
30 
31 int main() {
32     static int T,mx;
33     static lli n,m,k,ans;
34     scanf("%d",&T);
35     while(T--) {
36         scanf("%lld%lld%lld%d",&n,&m,&k,&mod) , --n , --m , memset(f,-1,sizeof(f)) , memset(g,0,sizeof(g)) , mx = std::max( cutbit(k,bc) , std::max( cutbit(n,ba) , cutbit(m,bb) ) ) ,
37         dfs(mx,1,1,1) , ans = (f[mx][1][1][1]-g[mx][1][1][1]*(k%mod)%mod+mod)%mod , printf("%lld\n",ans);
38     }
39     return 0;
40 }