Bitwise And Queries

Bitwise And Queries

Time limit: 1500 ms
Memory limit: 128 MB

You are given QQ queries of the form a\ b\ xa b x. Count the number of values yy such that a \leq y \leq ba≤y≤b and x\ \& \ y = xx & y=x, where we denote by \&& the bitwise and operation.

Standard input

The first line contains a single integer QQ.

Each of the following QQ lines contains three integers a\ b\ xa b x, representing a query.

Standard output

Output QQ lines, each containing a single integer representing the answer to a query.

Constraints and notes

• 1 \leq Q \leq 10^51≤Q≤10​5​​
• 1 \leq a \leq b \leq 10^{18}1≤a≤b≤10​18​​
• 0 \leq x \leq 10^{18}0≤x≤10​18​​

Input	Output
4 1 10 3 5 10 0 1 63 7 32 100 32	2 6 8 37

 

x&y==x,说明x二进制表示上，有1的地方，y也要有1，是0的地方，y可以是0或者1，记忆化瞎几把搜一下就行了，每次可以选择的有0或1，再判断一下能否取0或1。

lr表示此时这个位置y能否取任意数，只要前面x为0，y为1时，递归选0的话，就说明y后面的数可以任意取了，因为前面有1选了0，那后面无论选什么都不可能超过上界了。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = ;
const int inf = 0x3f3f3f3f;
const int mod = ;
LL dp[][];
int A[],X[];
LL solve(int cur,int lr){
    if(cur == )return ;
    if(dp[cur][lr] != -)return dp[cur][lr];
    if(lr){
        if(A[cur]){
            return dp[cur][lr] = solve(cur + ,lr);
        }
        else {
            return dp[cur][lr] =  * solve(cur + ,lr);
        }
    }
    else {
        if(A[cur]){
            if(X[cur])return dp[cur][lr] = solve(cur + ,lr);
            else return dp[cur][lr] = ;
        }
        else {
            if(X[cur])return dp[cur][lr] = solve(cur+,) + solve(cur+,lr);
            else return dp[cur][lr] = solve(cur+,lr);
        }
    }
}
void print(int *x){
    for(int i = ; i < ; i++)
        printf("%d",x[i]);
    puts("");
}
int main(){
#ifdef local
    freopen("in", "r", stdin);
#endif
    int T;
    scanf("%d",&T);
    while(T--){
        LL x,y,a;
        scanf("%lld%lld%lld",&x,&y,&a);
        x--;
        for(int i = ; i < ; i++){
            A[i] = a & ;
            a >>= ;
        }
        reverse(A,A+);
//        print(A);
        for(int i = ; i < ; i++){
            X[i] = x & ;
            x >>= ;
        }
        reverse(X,X+);
//        print(X);
        memset(dp,-,sizeof dp);
        LL res = solve(,);
        for(int i = ; i < ; i++){
            X[i] = y & ;
            y >>= ;
        }
        reverse(X,X+);
//        print(X);
        memset(dp,-,sizeof dp);
        res = solve(,) - res;
        printf("%lld\n",res);
    }
}