Codeforces Round #313 (Div. 2)560D. Equivalent Strings
来源:互联网 发布:谓之知机什么意思 编辑:程序博客网 时间:2024/05/21 11:17
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:
- 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!
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.
Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.
aabaabaa
YES
aabbabab
NO
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".
#include <bits/stdc++.h>using namespace std;#define maxn 200010char a[maxn], b[maxn];bool dfs(char s1[], char s2[], int len){ if(!strncmp(s1, s2, len)) return 1; if(len % 2 == 1) return 0; int m = len/2; if(dfs(s1+m, s2, m)&&dfs(s1, s2+m, m)) return 1; if(dfs(s1, s2, m)&&dfs(s1+m, s2+m, m)) return 1;}int main(){ scanf("%s %s", a, b); int len = strlen(a); if(dfs(a, b, len)) printf("YES\n"); else printf("NO\n");}
- Codeforces Round #313 (Div. 2) 560D Equivalent Strings(dos)
- Codeforces Round #313 (Div. 2)560D. Equivalent Strings
- Codeforces Round #313 (Div. 2) D. Equivalent Strings 字符串处理
- Codeforces Round #313 (Div. 2)D. Equivalent Strings(字符串)
- Codeforces Round #313 (Div. 2) D Equivalent Strings
- Codeforces Round #313 (Div. 2) Problem D - Equivalent Strings
- Equivalent Strings(Codeforces Round #313 (Div. 2) D)
- Codeforces Round #313 (Div. 2) D Equivalent Strings(dfs)
- Codeforces Round #313 (Div. 2) D. Equivalent Strings(简单搜索)
- Round #313 (Div. 2) D. Equivalent Strings-大水题递归
- Codeforces Round #313 (Div. 2) Equivalent Strings(搜索)
- Codeforces Round #313 (Div. 1) B. Equivalent Strings DFS暴力
- Codeforces Round #313 (Div. 1) B. Equivalent Strings
- codeforces Round 313 (Div. 1) B.Equivalent Strings
- Codeforces Round #313 D. Equivalent Strings(DFS)
- CodeForces#313 D. Equivalent Strings
- Codeforces Round #313 Equivalent Strings(递归)
- CodeForces - 560D Equivalent Strings (DFS)
- 针对 android端模拟教务系统登陆,主要针对抓包过程,post,get请求,和解析网页和cookie(二)
- redis key键(五)
- 上传文件总结--使用springMVC+ajaxfileupload.js
- php中json数据解析------!
- JBPM(六)流程变量
- Codeforces Round #313 (Div. 2)560D. Equivalent Strings
- 数据结构---散列
- 【多线程】——ArrayBlockingQueue跟LinkedBlockingQueue相比较
- ICCV2013、CVPR2013、ECCV2013目标检测相关论文
- H.264相关资料整理
- 查看Android应用包名、Activity的几个方法
- idea报错:[2016-08-31 09:20:10,763] Artifact xxx:war exploded: Error during artifact deployment.
- jquery轮播效果简单示例
- Java加密技术(十)——单向认证