Problem C. Not So Random Google APAC 2017 University Test Practice Round

这一题我开始想的是利用位运算的性质找到什么类似循环节规律出来，然而什么都没找到><。

事实上，可以计算每一个bit对应的期望值，expected final output就是各个bit的期望值按权值累加起来。

f[bit][0]表示第bit位值为0的概率，f[bit][1]表示第bit位值为1的概率。状态转移方程为f[bit][0]=f[bit in previous machine][0]*{0 or/and/xor K=0的概率}+f[bit in previous machine][1]*{1 or/and/xor K=0的概率}。f[bit][1]=f[bit in previous machine][0]*{0 or/and/xor K=1的概率}+f[bit in previous machine][1]*{1 or/and/xor K=1的概率}。

由于期望值可以累加，最终的结果就是。

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>

using namespace std;

//2017 Practice Round Problem C. Not So Random

int T;
const int maxn=32;
const double eps=1e-10;//use 1e-9 leads to WA
int A;
int B;
int C;
int N;
int X;
int K;
double ans=0;
int arrX[maxn];
int arrK[maxn];
double f[maxn][2];
int toBin(int *arr,int num)
{
    int st=0;
    for(int i=31;i>=0;i--)
    {
        //cout<<((1<<i)&num)<<endl;
        if(((1<<i)&num)!=0)
        {
            st=i;
            break;
        }
    }
    //cout<<st<<endl;
    for(int i=0;i<=st;i++)
    {
        if(((1<<i)&num)!=0)
        {
            arr[i]=1;
        }
        else
        {
            arr[i]=0;
        }
    }
    return st;
}
pair<double,double>prob(int a,int b)//a,b in {0,1}
{
    double ret0=0;//prob of val=0
    double ret1=0;//prob of val=1
    if((a&b)==1)
    {
        ret1+=A/100.0;
    }
    else if((a&b)==0)
    {
        ret0+=A/100.0;
    }
    if((a|b)==1)
    {
        ret1+=B/100.0;
    }
    else if((a|b)==0)
    {
        ret0+=B/100.0;
    }
    if((a^b)==1)
    {
        ret1+=C/100.0;
    }
    else if((a^b)==0)
    {
        ret0+=C/100.0;
    }
    //cout<<(a&b)<<" "<<(a|b)<<" "<<(a^b)<<endl;
    return make_pair(ret0,ret1);
}
int main()
{
    freopen("C-large-practice.in","r",stdin);
//    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    scanf("%d",&T);
    for(int ca=1;ca<=T;ca++)
    {
        scanf("%d %d %d %d %d %d",&N,&X,&K,&A,&B,&C);
        memset(arrX,0,sizeof(arrX));
        memset(arrK,0,sizeof(arrK));
        memset(f,0,sizeof(f));
        ans=0;
        int stx=toBin(arrX,X);
        int stk=toBin(arrK,K);
        int st=max(stx,stk);
//        for(int i=0;i<=st;i++)
//        {
//            cout<<arrX[i];
//        }
//        cout<<endl;
//        for(int i=0;i<=st;i++)
//        {
//            cout<<arrK[i];
//        }
//        cout<<endl;
        for(int i=0;i<N;i++)
        {
            //cout<<i<<endl;
            for(int bit=0;bit<=st;bit++)
            {
                double pre0=f[bit][0];
                double pre1=f[bit][1];
                //cout<<pre0<<" h1 "<<pre1<<" "<<arrX[bit]<<" "<<arrK[bit]<<endl;
                if(i==0)
                {
                    pair<double,double>tmp=prob(arrX[bit],arrK[bit]);
                    f[bit][0]=tmp.first;
                    f[bit][1]=tmp.second;
                    //cout<<tmp.first<<" h2 "<<tmp.second<<" "<<f[bit][0]<<" "<<f[bit][1]<<endl;
                }
                else
                {
                    pair<double,double>tmp0=prob(0,arrK[bit]);
                    pair<double,double>tmp1=prob(1,arrK[bit]);
                    f[bit][0]=pre0*tmp0.first+pre1*tmp1.first;//Markov chain
                    f[bit][1]=pre0*tmp0.second+pre1*tmp1.second;
                    //cout<<tmp0.first<<" h3 "<<tmp0.second<<" "<<tmp1.first<<" "<<tmp1.second<<" "<<f[bit][0]<<" "<<f[bit][1]<<endl;
                }

            }
        }
    for(int bit=0;bit<=st;bit++)
    {
        ans+=(1<<bit)*f[bit][1]+(0<<bit)*f[bit][0];
    }
        printf("Case #%d: %.12f\n",ca,ans);
    }
    return 0;
}