UVALive 4222 /HDU 2961 Dance 大模拟

Dance

Problem Description

For a dance to be proper in the Altered Culture of Machinema, it must abide by the following rules:

1. A dip can only appear 1 or 2 steps after a jiggle, or before a twirl, as in:
* ...jiggle dip...
* ...jiggle stomp dip...
* ...dip twirl...
2. All dances end with a clap stomp clap.
3. If a dance contains a twirl, it must have a hop.
4. No dance can start with a jiggle.
5. All dances must have a dip.

As instructor at a dance composition school, you must grade many freshman attempts at composing dances. You decide to make an automatic grader that can check against these rules.

 

Input

The input consists of a number of dances, one per line. Each dance has a maximum of 1000 steps. Each step is separated by a single space, and all steps are lowercase alphabetic words at most 100 letters long.

 

Output

If a dance in the input has no mistakes, then the output should contain the words "form ok: " followed by the original composition.

If a dance has a single type of form error, then the output should contain the words "form error K: " where K is the rule which failed, followed by the composition.

If a dance has multiple types of form errors, then the output should contain the errors as a comma separated clause, as in "form errors K(1), K(2), ..., K(N-1) and K(N): " where the form errors are in increasing order, followed by the composition.

If a dance has form error 1, every dip in the dance that violates rule 1 should be printed in upper case.

 

Sample Input

dip twirl hop jiggle hop hop clap stomp clap
dip hop jiggle hop hop clap stomp clap
dip twirl hop jiggle hop hop clap clap stomp
jiggle dip twirl hop jiggle hop hop clap stomp clap
jiggle dip
jiggle
dip twirl hop dip jiggle hop dip hop clap stomp clap

 

Sample Output

form ok: dip twirl hop jiggle hop hop clap stomp clap
form error 1: DIP hop jiggle hop hop clap stomp clap
form error 2: dip twirl hop jiggle hop hop clap clap stomp
form error 4: jiggle dip twirl hop jiggle hop hop clap stomp clap
form errors 2 and 4: jiggle dip
form errors 2, 4 and 5: jiggle
form error 1: dip twirl hop DIP jiggle hop dip hop clap stomp clap

 

题意：

 给出一串 dance串

　　问你是否满足 5个要求，不满足 输出哪些，对于要求1不满足 的dip都改成大写

　　需要满足条件如下：

　　　　1. A dip can only appear 1 or 2 steps after a jiggle, or before a twirl, as in:
* ...jiggle dip...
* ...jiggle stomp dip...
* ...dip twirl...
2. All dances end with a clap stomp clap.
3. If a dance contains a twirl, it must have a hop.
4. No dance can start with a jiggle.
5. All dances must have a dip.

　　

题解：

　　死模拟题

 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include<vector>
using namespace std ;
typedef long long ll;

const int N =  + ;
const int inf = 1e9 + ;

char a[N];
int len,H[N];
int check4() {
    if(len < ) return ;
    char b[] = {'j','i','g','g','l','e'};
    int cnt = ;
    for(int i = ; i < ; i++) {
        if(a[i] != b[cnt]) return ;
        cnt++;
    }
    return ;
}
int check2() {
    if(len < ) return ;
     char b[] = {"clap stomp clap"};
     int cnt = ;
    for(int i = len - ; i < len ;i ++) {
        if(a[i]!=b[cnt++]) return ;
    }
    return ;
}
int check5() {
    for(int i = ; i < len - ; i+=) {
        if(a[i] == 'd' && a[i+] == 'i' && a[i+] == 'p') return ;
    } return ;
}
int check3() {
    if(len < ) return ;
    for(int i = ; i <= len - ; i++) {
        if(a[i] == 't' && a[i+] == 'w' && a[i+] == 'i' && a[i + ] == 'r'&&a[i+]=='l') {
                for(int i = ; i < len - ; i++) {
                    if(a[i] == 'h' && a[i+] == 'o' && a[i+] == 'p') return ;
                }
                return ;
            }
        }
    return ;
}
void solve() {
    memset(H,,sizeof(H));
    vector<int> ans;
    len = strlen(a);
     if(!check2()) H[] = ;
   if(!check3()) H[] = ;
   if(!check4()) H[] = ;
    if( check5() ) {
        for(int i = ; i < len - ; i++) {
             if(a[i] == 'd' && a[i+] == 'i' && a[i+] == 'p') {
                int  f = ;
                 if(i -  >= ) {
                        int cnt2= ;
                      for(int j = i - ; j >=  ; j--) {
                        if(a[j] ==' ') cnt2++;
                        if(cnt2 == ) {cnt2 = j;break;}
                      }
                      if(cnt2 -  >= ) {
                              int flag = ;
                    char b[] = {"jiggle"};int cnt = ;
                     for(int j = cnt2 - ; j < cnt2; j ++) {
                        if(a[j]!= b[cnt++])  {flag =;break;}
                     }
                    if(!flag) f = ;
                      }
                 }
                if(i -  >= ) {
                         int flag = ;
                    char b[] = {"jiggle "};int cnt = ;
                     for(int j = i - ; j < i; j ++) {
                        if(a[j]!= b[cnt++])  {flag =;break;}
                     }
                    if(!flag) f = ;
                 }
                 if(i +  < len) {
                       int flag = ;
                    char b[] = {" twirl"};int cnt = ;
                     for(int j = i + ; j <= i+; j ++) {
                        if(a[j]!= b[cnt++])  {flag =;break;}
                     }
                    if(!flag) f = ;
                 }
                 if(f) {
                    a[i] = 'D';
                    a[i+] = 'I';
                    a[i+] = 'P';
                    H[] = ;
                 }
                 i += ;
             }
        }
    }
    else H[] = ;
   for(int i = ; i <= ; i++) {
    if(H[i]) ans.push_back(i);
   }
   if(!ans.size())cout<<"form ok: "<<a<<endl;
   else if(ans.size()==) printf("form error %d: %s\n",ans[],a);
   else if(ans.size() == ) printf("form errors %d and %d: %s\n",ans[],ans[],a);
   else if(ans.size() == ) printf("form errors %d, %d and %d: %s\n",ans[],ans[],ans[],a);
   else if(ans.size() == ) printf("form errors %d, %d, %d and %d: %s\n",ans[],ans[],ans[],ans[],a);
   else if(ans.size() == ) printf("form errors %d, %d, %d, %d and %d: %s\n",ans[],ans[],ans[],ans[],ans[],a);
}
int main() {
    while(gets(a)!=NULL) {
        solve();
    }
    return ;
}