zoukankan      html  css  js  c++  java
  • CodeForces

    Vus the Cossack has two binary strings, that is, strings that consist only of "0" and "1". We call these strings aa and bb. It is known that |b||a||b|≤|a|, that is, the length of bb is at most the length of aa.

    The Cossack considers every substring of length |b||b| in string aa. Let's call this substring cc. He matches the corresponding characters in bband cc, after which he counts the number of positions where the two strings are different. We call this function f(b,c)f(b,c).

    For example, let b=00110b=00110, and c=11000c=11000. In these strings, the first, second, third and fourth positions are different.

    Vus the Cossack counts the number of such substrings cc such that f(b,c)f(b,c) is even.

    For example, let a=01100010a=01100010 and b=00110b=00110. aa has four substrings of the length |b||b|: 0110001100, 1100011000, 1000110001, 0001000010.

    • f(00110,01100)=2f(00110,01100)=2;
    • f(00110,11000)=4f(00110,11000)=4;
    • f(00110,10001)=4f(00110,10001)=4;
    • f(00110,00010)=1f(00110,00010)=1.

    Since in three substrings, f(b,c)f(b,c) is even, the answer is 33.

    Vus can not find the answer for big strings. That is why he is asking you to help him.

    Input

    The first line contains a binary string aa (1|a|1061≤|a|≤106) — the first string.

    The second line contains a binary string bb (1|b||a|1≤|b|≤|a|) — the second string.

    Output

    Print one number — the answer.

    Examples
    input
    Copy
    01100010
    00110
    
    output
    Copy
    3
    
    input
    Copy
    1010111110
    0110
    
    output
    Copy
    4
    

     

     题意:
    给出一个01字符串a,一个01字符串b,将a中每一个长度和b相等的子串取出,问有多少个子串,和b对应位置上数字不同的个数是偶数。
     
    思路:
    使用异或运算即可。
    充分利用异或可交换的性质。
     
    #include<iostream>
    #include<algorithm>
    #include<vector>
    #include<stack>
    #include<queue>
    #include<map>
    #include<set>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<ctime>
    
    #define fuck(x) cout<<#x<<" = "<<x<<endl;
    #define debug(a, x) cout<<#a<<"["<<x<<"] = "<<a[x]<<endl;
    #define ls (t<<1)
    #define rs ((t<<1)|1)
    using namespace std;
    typedef long long ll;
    typedef unsigned long long ull;
    const int maxn = 1000086;
    const int maxm = 100086;
    const int inf = 0x3f3f3f3f;
    const ll Inf = 999999999999999999;
    const int mod = 1000000007;
    const double eps = 1e-6;
    const double pi = acos(-1);
    
    char a[maxn],b[maxn];
    
    int main() {
    //    ios::sync_with_stdio(false);
    //    freopen("in.txt", "r", stdin);
    
    
        scanf("%s%s",a,b);
        int lena = strlen(a);
        int lenb = strlen(b);
    
        int ans=0;
        for(int i=0;i<lenb;i++){
            ans^=(a[i]-48)^(b[i]-48);
        }
    
        int sum=0;
        if(!ans){sum++;}
    
        for(int i=lenb;i<lena;i++){
            ans^=(a[i]-48)^(a[i-lenb]-48);
            if(!ans){sum++;}
        }
        printf("%d",sum);
    
    
    
    
        return 0;
    }
    View Code
     
  • 相关阅读:
    PS只能各个工具使用的注意知识点
    怎样利用自动化工具做真实的项目
    抖音视频、新浪微博、今日头条、拼多多砍价 、淘宝业务、快手、小红书、大众点评刷数据
    前端开源实战项目推荐
    提问的智慧
    论程序员为何加班—我的工作日常
    大白话入门 Spring Cloud
    Java 书单
    Spring Boot 经典开源项目推荐
    Flash 终将谢幕:微软将于年底( 2020 年 )停止对 Flash 的支持
  • 原文地址:https://www.cnblogs.com/ZGQblogs/p/11161812.html
Copyright © 2011-2022 走看看