Codeforces Round #336 (Div. 2) B. Hamming Distance Sum

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.

题意：两个字符串直接的距离是，求a和b的子串（连续的并且长度和a相等的子串）的距离的和。

思路：其实对于a中第i个字符串都要和b中的i~blen-(alen-i)（alen、blen分别是字符串a、b的长度）作差，因为字符串内就只有‘1’和‘0’了，那么就可以先求出b中前i个字符中‘1’和‘0’的个数（1<=I<=blen），然后再遍历a求出总距离。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define maxn 200005
#define ll long long int
ll p[maxn][2];
char a[maxn], b[maxn];
int main()
{
    int alen, blen, i, j;
    ll res = 0;
    scanf("%s", a);
    scanf("%s", b);
    alen = strlen(a);
    blen = strlen(b);
    for(i = 0;i < blen;i++)
    {
        if(i > 0)
        {
            p[i][0] = p[i-1][0];
            p[i][1] = p[i-1][1];
        }
        p[i][b[i] - '0']++;
        //printf("%d %d\n", p[i][0], p[i][1]);
    }

    for(i = 0;i < alen;i++)
    {
        if(a[i] == '1')
            res += (p[blen-(alen-i)][0] - p[i][0] + (a[i]==b[i]?0:1));
        else
            res += (p[blen-(alen-i)][1] - p[i][1] + (a[i]==b[i]?0:1));
        //printf("%d\n", res);
    }
    printf("%I64d\n", res);
}