hdu 5695 扫雷(思维)(遇事不决就枚举)

就很烦啊,感觉这两天应该是可以休息一下,但是水平太差了,然后整个人都一个很混沌的状态,要开学了,心很乱.
这题一开始不会啊,想了很久递推,但感觉很难实现,百度了一下,发现可以枚举前两行,但是要注意了,并不是这样就万事大吉,可能在过程中,会出现非法状况,所以要去掉.
题目可能会直接给出非法状况,(1的时候?),wa了好多次

/*  xzppp  */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <math.h>
#include <string>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
const int MAXN = 1e5+17;
const int MAXM = 20;
const int INF = 0x7fffffff;
const int MOD = 100000007;
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    int t;
    cin>>t;
    while(t--)
    {
        string str;
        cin>>str;
        if(str.size()==1)
        {
            if(str[0]=='1') cout<<2<<endl;
            else if( str[0]>'2') cout<<0<<endl;
            else cout<<1<<endl;
            continue;
        }
        LL ans = 0;
        for (int i = 0; i <= min(2,str[0]-'0'); ++i)
        {
            LL temp = 1;
            int j = str[0]-'0'-i;
            if(i>2||j>2) continue;
            if(i==1) temp*=2;
            if(j==1) temp*=2;
            int l = i;
            int r = j;
            int now = str[1]-'0'-l-r;
            for (int k = 2; k < str.size(); ++k)
            {
                if(now==1) temp = (temp*2)%MOD;
                l = r;
                r = now;
                now = str[k]-'0'- l - r;
                if(now>2) 
                {
                    temp = 0;
                    break;
                }
            }
            if(now==0)
                ans = (ans + temp) %MOD;
        }
        cout<<(ans%MOD+MOD)%MOD<<endl;
    }

    return 0;

}