【組隊賽三】-C cf448B

標籤：des   style   color   os   io   2014   

Suffix Structures
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

CodeForces 448B
Description
Bizon the Champion isn‘t just a bison. He also is a favorite of the "Bizons" team.

At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word s into word t". The task looked simple to the guys because they know the suffix data structures well. Bizon Senior loves suffix automaton. By applying it once to a string, he can remove from this string any single character. Bizon Middle knows suffix array well. By applying it once to a string, he can swap any two characters of this string. The guys do not know anything about the suffix tree, but it can help them do much more.

Bizon the Champion wonders whether the "Bizons" can solve the problem. Perhaps, the solution do not require both data structures. Find out whether the guys can solve the problem and if they can, how do they do it? Can they solve it either only with use of suffix automaton or only with use of suffix array or they need both structures? Note that any structure may be used an unlimited number of times, the structures may be used in any order.

Input
The first line contains a non-empty word s. The second line contains a non-empty word t. Words s and t are different. Each word consists only of lowercase English letters. Each word contains at most 100 letters.

Output
In the single line print the answer to the problem. Print "need tree" (without the quotes) if word s cannot be transformed into word t even with use of both suffix array and suffix automaton. Print "automaton" (without the quotes) if you need only the suffix automaton to solve the problem. Print "array" (without the quotes) if you need only the suffix array to solve the problem. Print "both" (without the quotes), if you need both data structures to solve the problem.

It‘s guaranteed that if you can solve the problem only with use of suffix array, then it is impossible to solve it only with use of suffix automaton. This is also true for suffix automaton.

Sample Input
Input
automaton
tomat
Output
automaton
Input
array
arary
Output
array
Input
both
hot
Output
both
Input
need
tree
Output
need tree
Hint
In the third sample you can act like that: first transform "both" into "oth" by removing the first character using the suffix automaton and then make two swaps of the string using the suffix array and get "hot".

<span style="color:#3333ff;">/*——————————————————————————————————————————————————————————————————————              author    :     Grant Yuan       time      :     2014.7.22       algorithm :     字串匹配       explain   :     對兩個字串中的每個字元的個數進行統計，如果第二個字串中有字元的個數                       比第一個字串中相應字元的個數多，則輸出“need tree”；                       否則，用字串B在A中進行單個字元的一一匹配，如果能夠匹配下來，則為“automaton”，否則，如果兩個字串的長度                       相等，則為“array”，如果前麵條件都不滿足，則為“both”。        ——————————————————————————————————————————————————————————————————————     */                  #include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;int a[26];char s1[103],s2[103];int l1,l2;int main(){    while(~scanf("%s%s",&s1,&s2)){        l1=strlen(s1);        l2=strlen(s2);        memset(a,0,sizeof(a));        int t=0;        for(int i=0;i<l1;i++)        {            a[s1[i]-'a']++;        }        for(int i=0;i<l2;i++)            a[s2[i]-'a']--;        int flag1=1;        for(int i=0;i<26;i++){            if(a[i]<0)              flag1=0;            }            if(flag1==0)                printf("need tree\n");             else  {                        int t=0;                        for(int i=0;i<l1;i++)                                if(s1[i]==s2[t]) t++;                        if(t==l2)                            printf("automaton\n");                        else                                if(l1==l2) printf("array\n");                        else                                printf("both\n");             }    }    return 0;}</span>