codeforces 608 B (前缀和)

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 si is the i-th character of s and ti 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两个字符串, 求b中与a长度相同的所有子串与a字符串距离之和.

思路：只要能发现 i 位置会一个遍历从 i 到 lenb - lena + i， 然后我们只需要求前缀和，b 串 中前 i 个字符有多少个 0 ，多有个 1。 如果 a[i] == '0' ， 就只需要 求 相应区间 1 的个数即可

AC代码：

#include<bits/stdc++.h>
using namespace std;

char a[200020] = {'0'},b[200020] = {'0'};
int pre0[200020],pre1[200020];
int main()
{
    while(~scanf("%s %s",a + 1,b + 1)){
        memset(pre0,0,sizeof(pre0));
        memset(pre1,0,sizeof(pre1));
        int lenb = strlen(b) - 1;
        for(int i = 1;i <= lenb;i ++){
            if(b[i] == '0'){
                pre0[i] = pre0[i-1] + 1;
                pre1[i] = pre1[i-1];
            }
            else{
                pre1[i] = pre1[i-1] + 1;
                pre0[i] = pre0[i-1];
            }
        }
        int lena = strlen(a) - 1;
        long long sum = 0;
        for(int i = 1;i <= lena;i ++){
            if(a[i] == '0'){
                sum += pre1[lenb-lena+i] - pre1[i-1];
            }
            else {
                sum += pre0[lenb-lena+i] - pre0[i-1];
            }
        }
        printf("%I64d\n",sum);
    }
    return 0;
}