题意:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/7b13517a1ffc7d60e18c15a9a1318315.png)
解法:
题目其实就是求逆序对.
假设两个下标为q和e.那么下标q对应的值为q^x
q<e
q^x > e^x
对于s[i]='0'的位置,没有贡献,因为异或不影响大小.下面考虑s[i]='1'的情况.
假设q和e的[1,i-1]位相同,第i位不同,[i+1,n]随意
因为q<e,所以第i位一定是q=0,e=1
方案数为左边方案数*右边方案数
左边方案数为f[i-1]
右边方案数为f[n-i]*f[n-i]
code:
#include<bits/stdc++.h>
typedef std::vector<int> VE;
typedef std::pair<int,int> PI;
#define int long long
#define ll long long
#define ull unsigned long long
#define all(a,n) a+1,a+1+n
#define ff(i,n) for(ll i=1;i<=n;i++)
#define rff(i,n) for(ll i=n;i>=1;i--)
#define fff(i,n) for(ll i=0;i<n;i++)
#define rfff(i,n) for(ll i=n-1;i>=0;i--)
#define SC(x) scanf("%s",x)
#define SL(x) strlen(x)
#define pss(a) push_back(a)
#define ps(a) push(a)
#define SZ(x) (int)x.size()
#define pee puts("");
#define eee putchar(' ');
#define re readdd()
#define pr(a) printtt(a)
int readdd(){int x=0,f=1;char c=getchar();
while(!isdigit(c)&&c!='-')c=getchar();
if(c=='-')f=-1,c=getchar();
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f*x;}
void printtt(int x){if(x<0)putchar('-'),x=-x;
if(x>=10)printtt(x/10);putchar(x%10+'0');}
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int ppow(int a,int b,int mod){a%=mod;
int ans=1%mod;while(b){if(b&1)ans=(long long)ans*a%mod;
a=(long long)a*a%mod;b>>=1;}return ans;}
bool addd(int a,int b){return a>b;}
int lowbit(int x){return x&-x;}
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};
bool isdigit(char c){return c>='0'&&c<='9';}
bool Isprime(int x){
for(int i=2;i*i<=x;i++)if(x%i==0)return 0;
return 1;
}
void ac(int x){if(x)puts("YES");else puts("NO");}
using namespace std;
const int mod=1e9+7;
const int maxm=2e6+5;
char s[maxm];
int f[maxm];
int n;
void solve(){
SC(s+1);
n=SL(s+1);
int ans=0;
f[0]=1;
ff(i,n)f[i]=f[i-1]*2%mod;
ff(i,n){
if(s[i]=='1'){
int l=f[i-1];
int r=f[n-i]*f[n-i]%mod;
ans=(ans+l*r%mod)%mod;
}
}
pr(ans);pee;
}
void Main(){
#ifdef MULTI_CASE
int T;cin>>T;while(T--)
#endif
solve();
}
void Init(){
#ifdef SYNC_OFF
ios::sync_with_stdio(0);cin.tie(0);
#endif
#ifndef ONLINE_JUDGE
freopen("../in.txt","r",stdin);
freopen("../out.txt","w",stdout);
#endif
}
signed main(){
Init();
Main();
return 0;
}