codeforces-559B-Equivalent Strings


codeforces-559B-Equivalent Strings


                    time limit per test2 seconds    memory limit per test256 megabytes

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

They are equal.
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:
a1 is equivalent to b1, and a2 is equivalent to b2
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.

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

题目链接:cf-559B

题目大意:等价串。如果字符长度为奇数:a == b;如果字符长度为偶数a1和b1,a2和b2或者a1和b2,b1和a2是等价串。
(理解好久题目意思。。)

题目思路:直接模拟,递归

以下是代码:

#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
using namespace std;
string a,b,a1,a2,b1,b2;
string isep(string s)
{
    if (s.size() % 2) return s;
    string a1 = isep(s.substr(0,s.size() / 2));
    string a2 = isep(s.substr(s.size() / 2,s.size()));
    if(a1 > a2) return (a2 + a1);
    else return (a1 + a2);
}
int main(){
    cin >> a >> b;  
    if (isep(a) == isep(b)) cout << "YES\n";
    else cout << "NO\n";
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值