CodeForces 608B Hamming Distance Sum（前缀和）

题意：给你一个a串，和一个b串，让A串去依次匹配b[0]-b[lena-1],b[1]-b[lena],b[2]-b[lena+].....，然后权值就是上下相减的绝对值，问你最后的权值和是多少

思路：记录B串的前缀和，对于A串的每个字母而言，他所花费的代价，就是他移动的区间中，和他不一样的数的个数就好了，直接扫一遍就OK

#include<bits\stdc++.h>
using namespace std;
const int maxn = 200005;
#define LL long long
LL sum[maxn][2];
char s1[maxn],s2[maxn];
int a[maxn],b[maxn];

int main()
{
    scanf("%s%s",s1+1,s2+1);
	int len1= strlen(s1+1);
	int len2 = strlen(s2+1);
	for(int i = 1;i<=len1;i++)
		a[i]=s1[i]-'0';
	for(int i = 1;i<=len2;i++)
		b[i]=s2[i]-'0';
	for(int i = 1;i<=len2;i++)
	{
		for(int j = 0;j<2;j++)
			sum[i][j]+=sum[i-1][j];
		sum[i][b[i]]++;
	}
	LL ans = 0;
	for(int i = 1;i<=len1;i++)
	{
		ans+=sum[len2-len1+i][1-a[i]];
		ans-=sum[i-1][1-a[i]];
	}
	printf("%lld\n",ans);
}

Description

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 Input

Input

01
00111

Output

3

Input

0011
0110

Output

2

Hint

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.