bzoj 4513: [Sdoi2016]储能表

神奇乱搞；
“二进制分组”

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
#define rep2(i,k,n) for(int i=k;i>=(n);i--)
using namespace std;
typedef long long ll;
int T,p,ans=0;ll n,m,q,zn,zm,bin[63];
int Sum(ll l,ll r){
    ll Ans=(r-l+1)%(2*p);
    Ans=Ans*((l+r)%(2*p))%(2*p);
    Ans/=2;Ans%=p;
    return Ans;
}
int Cal(ll x,int tx,ll y,int ty){
    if(tx<ty){
        swap(x,y);swap(tx,ty);
    }
    int Ans=0;
    x^=(x&(bin[tx]-1));
    y^=(y&(bin[tx]-1));
    ll z=x^y;
    if(z>q){
        Ans+=Sum(z-q,z+bin[tx]-1-q);
        Ans%=p;
    }
    else if(q<(z+bin[tx]-1)){
        Ans+=Sum(0,z+bin[tx]-1-q);
        Ans%=p;
    }
    z=bin[ty]%p;
    z=z*Ans%p;
    Ans=z;
    return Ans;
}
int main(){//freopen("in.in","r",stdin);
//freopen("out.out","w",stdout);
bin[0]=1;rep(i,1,62)bin[i]=bin[i-1]<<1;
    scanf("%d",&T);
    while(T--)
    {cin>>n>>m>>q>>p;
    ans=0;
    zn=0;
    rep2(i,62,0){
        if(n&bin[i]){zm=0;
            rep2(j,62,0){
                if(m&bin[j]){
                    ans=(ans+Cal(zn,i,zm,j))%p;
                    zm|=bin[j];
                }
            }
            zn|=bin[i];
        }
    }
    printf("%d\n",ans);
    }
}