MU Puzzle HDU - 4662

Suppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one word MI, and transform it to get a new word. In each step, we can use one of the following transformation rules: 
1. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU. 
2. Replace any III with a U. For example: MUIIIU to MUUU. 
3. Remove any UU. For example: MUUU to MU. 
Using these three rules is it possible to change MI into a given string in a finite number of steps? 

InputFirst line, number of strings, n. 
Following n lines, each line contains a nonempty string which consists only of letters 'M', 'I' and 'U'.

Total length of all strings <= 10 ⁶.Outputn lines, each line is 'Yes' or 'No'.Sample Input

2
MI
MU

Sample Output

Yes
No

所有U都是由I换来的，而U不能再换成I，所以可以讲所有U换成I的数目进行统计，如果符合要求即可
1.相当于I的数目*2
3.相当于I的数目-6

#include <cstdio>
#include <cstring>

using namespace std;

const int maxn =  + ;
char s[maxn];
int p[];

void init(){
    p[] = ;
    for(int i = ; i < ; i++) p[i] = (p[i-] << );
}

bool solve(){
    bool ok = ;
    int len = strlen(s), i, Mcnt = , Icnt = ;
    for(i = ; i < len; i++){
        if(s[i] == 'M') Mcnt++;
        else if(s[i] == 'I') Icnt++;
        else if(s[i] == 'U') Icnt += ;
    }
    if(Mcnt ==  && s[] == 'M'){
        for(i = ; i >= ; i--) if(p[i] >= Icnt && (p[i] - Icnt) %  == ) {
            ok = ;
            break;
        }
    }
    return ok;
}

int main()
{
    int n;
    init();
    scanf("%d", &n);
    getchar();
    while(n--){
        scanf("%s", s);
        if(solve()) printf("Yes\n");
        else printf("No\n");
    }
    return ;
}