2020年icpc上海站 C题Sum of Log
题目链接
前提:我假设len(x)函数为x的二进制长度,比如:len(8)=4,8的二进制长度4
大意为对于全部小于X的数xi,对于Y中的所有数yj中与xi进行&运算后为0的max(len(xi),len(yi))进行求和
然后数位dp走一波,记得开long long,就a了OVO
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<queue>
#define int long long
const int maxn=1e4+10;
const int inf=1e9+10;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define fep(i,a,b) for(int i=(b);i>=(a);--i)
#define scf(x) scanf("%lld",&x)
#define scfd(x) scanf("%lf",&x)
#define prf(x) printf("%lld\n",x)
#define deprf(x) printf("[%d]\n",x)
#define depd(x) printf("[%.3lf]\n",x)
#define mset(x,y) memset(x,y,sizeof(x))
const int mod=1e9+7;
#define AC return 0
const int eps=1e-8;
const double PI=acos(-1.0);
using namespace std;
int a[2][40];
int dp[40][2][2];
int dfs(int pos,int limit1,int limit2)
{
if(!pos)return 1;//到达最后一位,证明我们以及找到了一种可能
if(dp[pos][limit1][limit2]!=-1)return dp[pos][limit1][limit2];//记忆化
int x1=limit1?1:a[0][pos];
int x2=limit2?1:a[1][pos];
int ans=0;
rep(i,0,x1)rep(j,0,x2)if((i&j)==0)//满足条件才dp
{
ans=(ans+dfs(pos-1,limit1||i<x1,limit2||j<x2))%mod;
}
return dp[pos][limit1][limit2]=ans;
}
int cal(int x,int id)
{
int tot=0;
while(x)
{
a[id][++tot]=x&1;
x>>=1;
}
return tot;
}
int len1,len2;
int solve()
{
int ans=0,res=0;;
mset(dp,-1);
rep(i,1,max(len1,len2))
{
res=0;
if(i<=len1)res=(res+dfs(i-1,i<len1,i<=len2))%mod;
if(i<=len2)res=(res+dfs(i-1,i<=len1,i<len2))%mod;
ans=(ans+res*i%mod)%mod;
}
return ans;
}
signed main()
{
int t;
scf(t);
while(t--)
{
mset(a,0);
int x,y;
scf(x);scf(y);
len1=cal(x,0);
len2=cal(y,1);
prf(solve());
}
AC;
}