zoukankan      html  css  js  c++  java
  • CF 559B(Equivalent Strings-构造法)

    B. Equivalent Strings
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are calledequivalent in one of the two cases:

    1. They are equal.
    2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
      1. a1 is equivalent to b1, and a2 is equivalent to b2
      2. a1 is equivalent to b2, and a2 is equivalent to b1

    As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.

    Gerald has already completed this home task. Now it's your turn!

    Input

    The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.

    Output

    Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.

    Sample test(s)
    input
    aaba
    abaa
    
    output
    YES
    
    input
    aabb
    abab
    
    output
    NO
    
    Note

    In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".

    In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".


    题目看错了666

    能分就分,且把字典序小的排前面



    #include<bits/stdc++.h>
    using namespace std;
    
    string equ(string s)
    {
    	int n=s.length();
    	if (n&1) return s;
    	string s1= equ(s.substr(0,n/2));
    	string s2= equ(s.substr(n/2,n/2));
    	if (s1<s2) return s1+s2;
    	return s2+s1;
    }
    string s1,s2;
    int main()
    {
    	cin>>s1>>s2;
    	if (equ(s1).compare(equ(s2))==0)
    	{
    		cout<<"YES"<<endl;
    	}
    	else cout<<"NO"<<endl;
    	return 0;
    }





  • 相关阅读:
    排序简介
    排序集锦
    排序图解
    UVA 11809
    uva1588kickdown
    C++中输入输出的重定向
    uva1587BOX
    uva 10340 All in All
    uva 1368 DNA Consensus String
    彻底理解MapReduce shuffle过程原理
  • 原文地址:https://www.cnblogs.com/llguanli/p/7308635.html
Copyright © 2011-2022 走看看