Codeforces Round #313 (Div. 2) D. Equivalent Strings(简单搜索)
2015-07-23 16:19
555 查看
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 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.
Sample test(s)
Input
Output
Input
Output
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".
题目链接:codeforces.com/contest/560/problem/D
题目大意:给出两串长度相等的字符串a,b,问其是否为等价字符串。
判断依据为:1.两个字符串相等。
2.把每个字符串拆分成长度相等的两个子串:a=a1+a2,b=b1+b2,如果a1=b2且a2=b1,则a与b等价
深搜递归判断子串是否等价,子串等价,主串就一定等价。注意子串长度相等的条件,不满足不能拆。
代码如下:
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 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.
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".
题目链接:codeforces.com/contest/560/problem/D
题目大意:给出两串长度相等的字符串a,b,问其是否为等价字符串。
判断依据为:1.两个字符串相等。
2.把每个字符串拆分成长度相等的两个子串:a=a1+a2,b=b1+b2,如果a1=b2且a2=b1,则a与b等价
深搜递归判断子串是否等价,子串等价,主串就一定等价。注意子串长度相等的条件,不满足不能拆。
代码如下:
#include <cstdio> #include <cstring> #include <iostream> #include <string> using namespace std; string a,b; bool eq(int len,string x,string y)//用来判断x,y是否等价 { if(x==y) return true; if(len%2||len==0) //当主串不能拆时,不等价 return false; len/=2; string a1=x.substr(0,len); string a2=x.substr(len,len); string b1=y.substr(0,len); string b2=y.substr(len,len); if(eq(len,a1,b2)&&eq(len,a2,b1)) return true; if(eq(len,a1,b1)&&eq(len,a2,b2)) return true; return false; } int main(void) { cin>>a; cin>>b; bool p=true; int len=a.length(); if(eq(len,a,b)) printf("YES\n"); else printf("NO\n"); }
相关文章推荐
- java 根据value进行并发同步操作
- NetSuite crm国内合作商来讲讲NetSuite常见问题
- String 与StringBuilder
- HDU 1242 Rescue(DFS or BFS)
- EF中使用SqlQuery进行参数化查询时抛出异常
- UIScrollView - 常用方法总结
- [SoapUI] SoapUI命令行方式运行
- Qt GUI 通过鼠标事件剖析整个事件处理流程(基于Qt4.5.2源码windows平台)
- UI—代理简单使用
- 下载:Win10 Build 10240 RTM官方简体中文镜像泄露(32/64位)
- 关于ueditor在Java中文件上传问题,404问题
- 关于ueditor在Java中文件上传问题,404问题
- [iOS学习]关于UILabel计算多行高度以及显示的问题
- CoreBluetooth之数据的读取与发送
- OS X 10.10 编译APUE Third Edition 源码
- web UI简介
- easyUI在IE浏览器中列表不显示
- UITabBarController的使用和坑
- 01-复杂度2. Maximum Subsequence Sum
- easyui 获取当前页签选中的名称