Codeforces Round #313 (Div. 2) 560D Equivalent Strings(dos)
来源:互联网 发布:易投水利造价软件 编辑:程序博客网 时间:2024/05/19 15:42
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".
题目链接:点击打开链接
定义两字符串相等的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;}
- 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)
- 基于RTSP的流媒体播放器制作(1)
- vs2013报错 无法打开包含文件 "winsock2.h" 的一种解决办法
- 实战c++中的vector系列--vector<unique_ptr<>>赋值给vector<unique_ptr<>>
- java截取字符串,截串,substring和split,分割字母和数字,正则缝隙
- 介绍一下Python科学计算常用的工具、库、发行版
- Codeforces Round #313 (Div. 2) 560D Equivalent Strings(dos)
- Git入门---一般使用
- 什么是maven
- **线程里面使用注解(线程里面spring使用注解无法注入值的解决办法)**
- 双向链表
- 【leetcode题解】【再看一遍】【86】【M】Contains Duplicate III
- 二叉树Q
- 用树莓派制作智能小车
- 第十三周项目1-Prim算法的验证