Codeforces Round #313 (Div. 2) 560D Equivalent Strings(dos)

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

题目链接:点击打开链接

定义两字符串相等的2种情况, 1是各个字母相应同样, 2是a字符串分为两半a1, a2, b字符串分为两半b1, b2, 当且仅当(a1 == b1 && a2

== b2) || (a1 == b2 && a2 == b1), 推断两字符串是否相等.

深搜, 每一次dfs先推断s1, s2的len个字母是否相等, 若len为奇数直接return false, 进而继续分两种情况进行dfs.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "queue"
#include "stack"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
#include "list"
#include "string"
#include "cstdlib"
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e5 + 5;
char s1[MAXN], s2[MAXN];
bool dfs(char s1[], char s2[], int len)
{
	if(!strncmp(s1, s2, len)) return true;
	if(len & 1) return false;
	int x = len >> 1;
	if(dfs(s1, s2 + x, x) && dfs(s1 + x, s2, x)) return true;
	if(dfs(s1, s2, x) && dfs(s1 + x, s2 + x, x)) return true;
	return false;
}
int main(int argc, char const *argv[])
{
	scanf("%s%s", s1, s2);
	if(dfs(s1, s2, strlen(s1))) printf("YES\n");
	else printf("NO\n");
	return 0;
}