zoukankan      html  css  js  c++  java
  • Codeforces Round #256 (Div. 2) B Suffix Structures

    B. Suffix Structures

    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 test(s)
    Input
    automaton
    tomat
    Output
    automaton
    Input
    array
    arary
    Output
    array
    Input
    both
    hot
    Output
    both
    Input
    need
    tree
    Output
    need tree
    Note

    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".

     1 #include<cstdio>
     2 #include<cstring>
     3 int n,i,j,l1,l2,a[26],b[26];
     4 char s[101],t[101];
     5 int main()
     6 {
     7     scanf("%s",s);
     8     scanf("%s",t);
     9     l1=strlen(s);
    10     l2=strlen(t);
    11     for(i=0;i<l1;++i)++a[s[i]-'a'];
    12     for(i=0;i<l2;++i)++b[t[i]-'a'];
    13     for(i=0;i<26;++i)if(a[i]<b[i])break;
    14     if(i<26)
    15         printf("need tree
    ");
    16     else{
    17         for(i=j=0;i<l2&&j<l1;++i,++j)while(j<l1&&s[j]!=t[i])++j;
    18         printf("%s
    ",i<l2?(l1==l2?"array":"both"):"automaton");
    19     }
    20     return 0;
    21 }
    View Code
  • 相关阅读:
    前台线程与后台线程,AfxGetApp>GetMainWnd()与AfxGetMainWnd的不同 (转)
    详细解说 STL 排序(Sort) (转)
    (转)怎样从一个DLL中导出一个C++类
    HTTP协议之状态码详解(转)
    关于列表(ListCtrl)控件的界面基础知识
    C++序列化(转)
    vs2008修改Menu(菜单)资源ID的方法。
    怎样解决VC中滚动条最大滚动值不能超过32767的问题
    < Photoshop CS 专栏 >颜色(二)
    C#使用BinaryReader类读取二进制文件
  • 原文地址:https://www.cnblogs.com/qscqesze/p/3852502.html
Copyright © 2011-2022 走看看