Codeforces 608B 找规律

B. Hamming Distance Sum

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Genos needs your help. He was asked to solve the following programming problem by Saitama:

The length of some string s is denoted |s|. The Hamming distance between two strings s and t of equal length is defined as , where s_i is the i-th character of s and t_i is the i-th character of t. For example, the Hamming distance between string "0011" and string "0110" is |0 - 0| + |0 - 1| + |1 - 1| + |1 - 0| = 0 + 1 + 0 + 1 = 2.

Given two binary strings a and b, find the sum of the Hamming distances between a and all contiguous substrings of b of length |a|.

Input

The first line of the input contains binary string a (1 ≤ |a| ≤ 200 000).

The second line of the input contains binary string b (|a| ≤ |b| ≤ 200 000).

Both strings are guaranteed to consist of characters '0' and '1' only.

Output

Print a single integer — the sum of Hamming distances between a and all contiguous substrings of b of length |a|.

Sample test(s)

Input

01
00111

Output

3

Input

0011
0110

Output

2

Note

For the first sample case, there are four contiguous substrings of b of length |a|: "00", "01", "11", and "11". The distance between "01" and "00" is |0 - 0| + |1 - 0| = 1. The distance between "01" and "01" is |0 - 0| + |1 - 1| = 0. The distance between "01" and "11" is |0 - 1| + |1 - 1| = 1. Last distance counts twice, as there are two occurrences of string "11". The sum of these edit distances is 1 + 0 + 1 + 1 = 3.

The second sample case is described in the statement.

题意：两个只有01的字符串a,b;问a在b中连续的一段等长的字符|ai-bi|的和是多少。

分析：贴个题解吧，我也是这么想的。

We are trying to find . Swapping the sums, we see that this is equivalent to .

Summing up the answer in the naive fashion will give an O(n²) solution. However, notice that we can actually find without going through each individual character. Rather, all we need is a frequency count of different characters. To obtain this frequency count, we can simply build prefix count arrays of all characters on b. Let's call this prefix count array F, where F[x][c] gives the number of occurrences of the character c in the prefix [0, x) of b. We can then write . as . This gives us a linear solution

我没注意到最后和的大小会爆int，WA了。。。。。谨记！

#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main()
{
    //freopen("f.txt","r",stdin);
    string a,b;
    cin>>a>>b;
    int na=a.size(),nb=b.size();
  //  cout<<nb-na<<endl;
    int compare=nb-na+1;
    LL sum=0,ans=0;
    for(int i=0;i<compare;i++)
        if(b[i]=='1')sum++;
     //    cout<<ans<<sum<<endl;
    for(int i=0;i<na;i++){
        //if(b[i]==)
        if(a[i]=='1') ans+=compare-sum;
        else ans+=sum;
        if(b[i]=='1')sum--;
        if(b[i+compare]=='1')sum++;
     //   cout<<ans<<"    "<<sum<<endl;
    }
    cout<<ans<<endl;
}