CF560D Equivalent Strings 可拆分的字符串是否等价

http://codeforces.com/contest/560/problem/D

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

方法一：

第一个递归往下字符串分成2份搜索：如果是奇数，则直接比较；偶数，先比较，如果不同，再切开分成两份进入下一层递归 （1000ms）

最底层长度为1，一定是奇数

#include <bits/stdc++.h>
using namespace std;
bool judge(char* a,char* b,int l)//比较函数
{
    for(int i=0;i<l;i++){
        if(a[i]!=b[i]) return false;
    }
    return true;
}
bool dfs(char* a,char* b,int l)
{
    int flag=0;
    if(judge(a,b,l)) flag=1;//字符串相同，标记1
    if(l%2==1){   ///奇数长度
        if(flag) return true;
        else return false;
    }
    else{   ///偶数长度
        if(flag) return true;
        else{  //字符串不同的情况下，切开进行比较
            l/=2;
            if(dfs(a,b,l)&&dfs(a+l,b+l,l) || dfs(a,b+l,l)&&dfs(a+l,b,l)) return true; //两种不同比较方式，一种成功即可
            else return false;
        }
    }
}
char a[200005],b[200005];
int main()
{
    while(~scanf("%s%s",a,b)){
        int l=strlen(a);
        printf("%s\n",dfs(a,b,l)?"YES":"NO");
    }
    return 0;
}

方法二：

如一同样是递归，不同的是并不在递归中进行比较，而是一边切割一边把字典序小的字符串放在前面。（复杂度更低，大概300ms）

有点类似字符串的最小表示法，因为字符串的最小表示法唯一，只有他们相同，则原字符串等价

#include<bits/stdc++.h>///大神的想法，简直66666666
using namespace std;
string Sort(string s){
    if(s.size()&1) return s;
    int l=s.size()>>1;
    string x=Sort(s.substr(0,l));  //可切割进下一层递归
    string y=Sort(s.substr(l,l));  //可切割进下一层递归
    return min(x,y)+max(x,y);      //字典序小的放前面
}
int main()
{
    string a,b;
    getline(cin, a);
    getline(cin, b);
    printf("%s\n",Sort(a)==Sort(b)?"YES":"NO"); //最小表示法的字符串是否相同
    return 0;
}