zoukankan      html  css  js  c++  java
  • Codeforces Round #313 (Div. 2) D. Equivalent Strings 解题心得

    原题:

    Description

    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:

    1. They are equal.
    2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same sizeb1 and b2, then one of the following is correct:
      1. a1 is equivalent to b1, and a2 is equivalent to b2
      2. 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 to200 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 Input

    Input
    aaba
    abaa
    Output
    YES
    Input
    aabb
    abab
    Output
    NO

    Hint

    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<cstdio>
    #include<cstring>
    int const Max = 250000;
    char a[Max], b[Max];
    
    bool isequal(char *a, char *b, int length)
    {
        if (!strncmp(a, b, length))
            return true;
        if (length % 2)
            return false; 
        int mid = length / 2;
        if (isequal(a, b + mid, mid) && isequal(a + mid, b, mid))
            return true;
        if (isequal(a, b, mid) && isequal(a + mid, b + mid, mid))
            return true;
        return false;
    
    }
    
    int main()
    {
        scanf("%s%s", a, b);
        printf("%s
    ", isequal(a, b, strlen(a)) ? "YES" : "NO");
    
    }
    View Code
  • 相关阅读:
    MYSQL中replace into的用法以及与inset into的区别
    怎么安装phpcms?PHPCMS V9安装图文教程
    Yii 框架生成缩略图
    怎么让普通用户使用root权限执行用户命令
    自学Linux命令的四种方法
    最完整PHP.INI中文版
    前端chrome浏览器调试
    phpstorm快捷键记录
    客户关系管理
    Subquery returns more than 1 row
  • 原文地址:https://www.cnblogs.com/shawn-ji/p/4696560.html
Copyright © 2011-2022 走看看