hdu 4662 MU Puzzle 余数

MU Puzzle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1468    Accepted Submission(s): 606

Problem Description

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?

 

Input

First 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 ⁶.

 

Output

n lines, each line is 'Yes' or 'No'.

 

Sample Input

  
  

   
   2
MI
MU
  
  

 

Sample Output

  
  

   
   Yes
No
  
  

 

Source

2013 Multi-University Training Contest 6

 

Recommend

zhuyuanchen520   |   We have carefully selected several similar problems for you:   5520  5519  5518  5517  5516

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<cctype>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n)  for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n)  for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n)  for(int i=(n) ;i>=0 ;i--)
#define  lson   num<<1,le,mid
#define rson    num<<1|1,mid+1,ri
#define MID   int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk    make_pair
#define _f     first
#define _s     second
using namespace std;
//const int INF=    ;
typedef long long ll;
//const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
const int INF =0x3f3f3f3f;
const int maxn=1000000+20    ;
//const int maxm=    ;


char s[maxn];

bool check()
{

   if(s[0]!='M')    return false;
   int len=strlen(s);
   int cnt=0;
   for(int i=1;i<len;i++)
   {
       if(s[i]=='M') return false;
       else if(s[i]=='I') cnt++;
       else  cnt+=3;
   }
   if(cnt==1)  return true;

    cnt=cnt%6;
   if(cnt==1||cnt==3||cnt==5||cnt==0)  return false;
   return true;



}
int main()
{
    int T;scanf("%d",&T);
    while(T--)
    {
        scanf("%s",s);
        if(check())  puts("Yes");
        else puts("No");
    }


    return 0;
}