URAL 1732 Ministry of Truth（KMP）

Description

In whiteblack on blackwhite is written the utterance that has been censored by the Ministry of Truth. Its author has already disappeared along with his whole history, and now, while Big Brother is watching somebody else, you, as an ordinary official of the Minitrue, have to delete some letters from the utterance so that another utterance will appear, which has been approved of by the Ministry.

The Ministry of Truth defines a word as a nonempty sequence of English letters and an utterance as a sequence of one or more words separated with one or more spaces. There can also be spaces before the first word and after the last word of an utterance. In order to compare two utterances, one should delete all the leading and trailing spaces and replace each block of consecutive spaces with one space. If the resulting strings coincide, then the utterances are considered to be equal. When the official deletes a letter from the utterance, this letter turns into a space.

Input

The first line contains the original utterance and the second line contains the utterance that must be obtained. The length of each utterance is at most 100000 symbols. The words in both utterances are separated with exactly one space; there are no leading or trailing spaces in each line. The original and the required utterances are different.

Output

If you can't carry out your order, output “I HAVE FAILED!!!” in the only line. Otherwise, output the original utterance replacing the letters that are to be deleted with the underscore character.

题目大意：给两行字符串，可以删掉上面的字符串的某些字符，删掉的字符变成空格，删完后能否变成下面的字符串。若能则输出上面的字符串，其中删掉的字符变成下划线。

思路：KMP给下面的每一个单词匹配上面的字符串就行了，注意细节处理。区分大小写。

PS：输入没有多余空格不要误会了。

PS2：之前误解了题意所以可能代码会有点奇葩……

代码（281MS）：

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #include <queue>
 using namespace std;
 typedef long long LL;
 
 const int MAXN = ;
 
 void getFail(char *P, int f[]) {
     int m = strlen(P);
     f[] = f[] = ;
     for(int i = ; i < m; ++i) {
         int j = f[i];
         while(j && P[i] != P[j]) j = f[j];
         f[i + ] = (P[i] == P[j] ? j +  : );
     }
 }
 
 int KMP(char *T, char *P, int f[]) {
     int n = strlen(T), m = strlen(P);
     getFail(P, f);
     int j = ;
     for(int i = ; i < n; ++i) {
         while(j && P[j] != T[i]) j = f[j];
         if(P[j] == T[i]) ++j;
         if(j == m) return i - m + ;
     }
     return -;
 }
 
 char s1[MAXN], s2[MAXN], ans[MAXN];
 char tmp[MAXN];
 int f[MAXN], ans_cnt;
 
 bool get_next(char *&src, char *ret) {
     while(*src == ' ') ++src;
     if(*src == ) return false;
     int i = ;
     while(*src != ' ' && *src != ) ret[i++] = *src, ++src;
     ret[i] = ;
     return true;
 }
 
 bool solve() {
     int now = ;
     ans_cnt = ;
     char *ss = s2;
     while(get_next(ss, tmp)) {
         int pos = KMP(s1 + now, tmp, f);
         if(pos == -) return false;
         //cout<<pos<<endl;
         for(int i = now; i < now + pos; ++i) {
             ans[ans_cnt++] = (s1[i] == ' ' ? ' ' : '_');
         }
         now += pos;
         for(int i = ; tmp[i]; ++i, ++now) ans[ans_cnt++] = tmp[i];
         //while(s1[now] != ' ' && s1[now] != 0) ans[ans_cnt++] = '_', ++now;
         if(s1[now]) {
             if(s1[now] != ' ') ans[ans_cnt++] = '_';
             else ans[ans_cnt++] = ' ';
             ++now;
         }
 
     }
     for(int i = now; s1[i]; ++i) {
         ans[ans_cnt++] = (s1[i] == ' ' ? ' ' : '_');
     }
     ans[ans_cnt++] = ;
     return true;
 }
 
 int main() {
     gets(s1);
     gets(s2);
     if(!solve()) puts("I HAVE FAILED!!!");
     else printf("%s\n", ans);
 }