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

    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 teven 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
    
    
    AC代码:
    #include<cstdio>
    #include<cstring>
    int n,i,j,l1,l2,a[26],b[26];
    char s[101],t[101];
    int main()
    {
    	scanf("%s",s);
    	scanf("%s",t);
    	l1=strlen(s);
    	l2=strlen(t);
    	for(i=0;i<l1;++i)++a[s[i]-'a'];
    	for(i=0;i<l2;++i)++b[t[i]-'a'];
    	for(i=0;i<26;++i)if(a[i]<b[i])break;
    	if(i<26)
    		printf("need tree
    ");
    	else{
    		for(i=j=0;i<l2&&j<l1;++i,++j)while(j<l1&&s[j]!=t[i])++j;
    		printf("%s
    ",i<l2?(l1==l2?"array":"both"):"automaton");
    	}
    	return 0;
    }


  • 相关阅读:
    第七周java学习总结
    第六周java学习总结
    20175206迭代与JDB测试
    第五周java学习总结
    实验一 Java开发环境的熟悉(Linux + Eclipse)
    第四周java学习总结
    第三周java学习总结
    es6零基础学习之项目目录创建(一)
    软键盘影响页面布局之定位
    当input的框全部不为空时,提交按钮变色
  • 原文地址:https://www.cnblogs.com/mthoutai/p/6918642.html
Copyright © 2011-2022 走看看