zoukankan      html  css  js  c++  java
  • [字符串]TrBBnsformBBtion

    TrBBnsformBBtion

    Let us consider the following operations on a string consisting of A and B:

    1. Select a character in a string. If it is A, replace it with BB. If it is B, replace with AA.
    2. Select a substring that is equal to either AAA or BBB, and delete it from the string.

    For example, if the first operation is performed on ABA and the first character is selected, the string becomes BBBA. If the second operation is performed on BBBAAAA and the fourth through sixth characters are selected, the string becomes BBBA.

    These operations can be performed any number of times, in any order.

    You are given two string S and T, and q queries ai,bi,ci,di. For each query, determine whether SaiSai+1Sbi, a substring of S, can be made into TciTci+1Tdi, a substring of T.

    数据范围

     

    • 1≤|S|,|T|≤105
    • S and T consist of letters A and B.
    • 1≤q≤105
    • 1≤aibi≤|S|
    • 1≤cidi≤|T|

    输入

     

    Input is given from Standard Input in the following format:

    S
    T
    q
    a1 b1 c1 d1
    
    aq bq cq dq
    

    输出

     

    Print q lines. The i-th line should contain the response to the i-th query. If SaiSai+1Sbi can be made into TciTci+1Tdi, print YES. Otherwise, print NO.

    输入样例1

     

    BBBAAAABA
    BBBBA
    4
    7 9 2 5
    7 9 1 4
    1 7 2 5
    1 7 2 4
    

    输出样例1

     

    YES
    NO
    YES
    NO
    

    The first query asks whether the string ABA can be made into BBBA. As explained in the problem statement, it can be done by the first operation.

    The second query asks whether ABA can be made into BBBB, and the fourth query asks whether BBBAAAA can be made into BBB. Neither is possible.

    The third query asks whether the string BBBAAAA can be made into BBBA. As explained in the problem statement, it can be done by the second operation.

    输入样例2

     

    AAAAABBBBAAABBBBAAAA
    BBBBAAABBBBBBAAAAABB
    10
    2 15 2 13
    2 13 6 16
    1 13 2 20
    4 20 3 20
    1 18 9 19
    2 14 1 11
    3 20 3 15
    6 16 1 17
    4 18 8 20
    7 20 3 14
    

    输出样例2

     

    YES
    YES
    YES
    YES
    YES
    YES
    NO
    NO
    NO
    NO
    


    代码:
     1 # include <bits/stdc++.h>  
     2 using namespace std;  
     3   
     4 const int N = 100010;  
     5 char s[N], t[N];  
     6 int sp[N], tp[N], q, a, b, c, d;
     7 int main() {  
     8     scanf("%s%s%d", s + 1, t + 1, &q); 
     9     for (int i = 1; s[i]; ++i) {
    10         sp[i] = sp[i - 1] + s[i] - 'A' + 1;  
    11     }
    12     for (int i = 1; t[i]; ++i) {
    13         tp[i] = tp[i - 1] + t[i] - 'A'  + 1;  
    14     }
    15     while(q--) {  
    16         scanf("%d%d%d%d", &a, &b, &c, &d);  
    17         if ( (sp[b] - sp[a - 1]) % 3 == (tp[d] - tp[c - 1]) % 3) {
    18             printf("YES
    ");
    19         }
    20         else {
    21             printf("NO
    "); 
    22         }
    23     }  
    24     return 0;  
    25 }  
  • 相关阅读:
    520了,用32做个简单的小程序
    sql使用手册
    大厂Redis高并发场景设计,面试问的都在这!
    如何根据普通ip地址获取当前地理位置
    理解Python闭包,这应该是最好的例子
    520了,用32做个简单的小程序
    适合 C++ 新手学习的开源项目——在 GitHub 学编程
    寄存器(内存访问)01 零基础入门学习汇编语言13
    寄存器(CPU工作原理)07 零基础入门学习汇编语言12
    数组08 零基础入门学习C语言30
  • 原文地址:https://www.cnblogs.com/GldHkkowo/p/8891170.html
Copyright © 2011-2022 走看看