B. Equivalent Strings
程序员文章站
2022-05-08 21:09:50
...
http://codeforces.com/contest/559/problem/B
题意:给两个字符串,两个串相等条件:(1)直接相等(2)两个字符串在中间切开后a1,a2; b1,b2 ;有a1=b2&&a2=b1;
可以一直分;
思路:递归搜索,奇数长度时直接判断;
#include<bits/stdc++.h>
/*#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>*/
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e6+9;
const int mod=1e9+7;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
int n;
char s[maxn],t[maxn];
bool ch(int st1,int ed1,int st2,int ed2)
{
for(int i=st1,j=st2;i<=ed1&&j<=ed2;i++,j++)
{
if(s[i]!=t[j]) return 0;
}
return 1;
}
bool dfs(int st1,int ed1,int st2,int ed2)
{
if((ed1-st1+1)%2)
{
return ch(st1,ed1,st2,ed2);
}
else
{
int mid1=(ed1+st1)>>1;
int mid2=(ed2+st2)>>1;
return ( dfs(st1,mid1,st2,mid2)&&dfs(mid1+1,ed1,mid2+1,ed2) ) || (dfs(st1,mid1,mid2+1,ed2)&&dfs(mid1+1,ed1,st2,mid2)) ;
}
}
int main()
{
//ios::sync_with_stdio(false);
while(cin>>s>>t)
{
bool f=0;
int lens=strlen(s);
int lent=strlen(t);
if(lens!=lent)
{
f=0;
}
else
{
f=dfs(0,lens-1,0,lent-1);
}
if(f) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
推荐阅读
-
Codefores Round #263 (div2) B. Appleman and Card Game
-
Android strings.xml使用方法及技巧
-
codeforces 1321 B. Journey Planning(贪心)
-
guava笔记6-Strings 博客分类: guavajava相关
-
⭐⭐⭐⭐⭐【KMP & 最小循环节】Power Strings
-
cf Educational Codeforces Round 55 B. Vova and Trophies
-
学军中学图灵杯趣味编程邀请赛题解 —— B. 回文串
-
2020“图灵杯”趣味网络邀请赛 B. 回文串(构造+二分)
-
Codeforces 1342 B. Binary Period
-
B. Box Fitting