Equivalent Strings(二分+递归深搜)
2015-07-27 15:44
337 查看
Link:http://codeforces.com/contest/559/problem/B
B. 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:
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".
AC code:
B. 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:
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".
AC code:
#include<iostream> #include<cstring> #include<cstdio> #include<cmath> using namespace std; string s1,s2; string equ(string s) { int lens=s.length(); if(lens&1) return s; string s1=equ(s.substr(0,lens/2)); string s2=equ(s.substr(lens/2,lens/2)); if(s1<s2) return s1+s2; else return s2+s1; } int main() { while(cin>>s1>>s2) { if(equ(s1)==equ(s2)) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- UIRefreshControl菊花转圈
- 电脑引导那些事(1)--BIOS,UEFI,MBR,GPT都是些啥?
- poj 1122 FDNY to the Rescue! 最短路径 dijkstra算法
- iOS UI切图@1x、@2x、@3x的实际尺寸
- hdu 5312 Sequence(三角形数的利用)
- PHP+MySQL+Easyui tree菜单从后台加载json数据(一)
- <%@ page include=""%> 和<jsp:include flush="true" page=""></jsp:include>两者的区别
- spoj 375 Query on the tree [树链剖分]
- UITextfield的键盘的设置
- Android4.4 SystemUI添加Dialog弹窗
- The Unique MST
- Android Volley的基本用法--StringRequest以及JsonReques
- Arduino UNO R3 + HC-SR04测距代码
- ZOJ 1649 Rescue BFS (搜索)
- epoll 或者 kqueue 的原理是什么?
- IOS:UITextField输入中文时限制长度
- POJ 3368.Frequent values(RMQ和线段树)
- POJ 2442.Sequence
- UITextfield设置Placeholder颜色 控件 内边距、自适应高度
- 自动获取UILabel的宽度高度