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

最新推荐文章于 2019-05-04 00:13:33 发布

zhaohuc

最新推荐文章于 2019-05-04 00:13:33 发布

阅读量659

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/ZZ_AC/article/details/50396202

版权

codeforces 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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 $\text{[math]}$ , 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 is1 + 0 + 1 + 1 = 3.

The second sample case is described in the statement.

题意：给你两个串 a,b

对于 "0011" ， "0110" 价值就是 |0 - 0| + |0 - 1| + |1 - 1| + |1 - 0| = 0 + 1 + 0 + 1 = 2.

a的长度严格小于等于b，a从b其实对应位置开始从右移到a,b末尾位置对应，问你在这一个过程中价值是多少

情况一：

如果两个字符串长度一样，可以直接求。

情况二：

如果两个字符串长度不一样。比如样例1.

模拟的话是

00111

第一步

结果为1

结果为0

结果为1

所以答案为3

但是长度为200 000，模拟时间的复杂度为O(n^2)显然会超时。

我们可以转换为b[i]字符和a的一些字符的Hamming 。

通过枚举我们可以发现规律。

00111

b字符串的第一个位置对应a字符串的第一个字符。

b字符串的第二个位置对应a字符串的前两个字符。

b字符串的第三个位置对应a字符串的第两个字符。

b字符串的第四个位置对应a字符串的第两个字符。

b字符串的第五个位置对应a字符串的最后个字符。

对任意的

a[0] a[1] a[2] a[3] ... a[n]

b[0] b[1] b[2] b[3] ... b[m] (m>=n)

1 2 3 ... k ... k ... 3 2 1 (对应的个数k <= n, k可能只有一个）

代码实现

#include
          
          
           
           
#include
           
           
            
            
#include
            
            
             
             
#include
             
             
              
              
#include
              
              
                #include 
                #include 
                
                  using namespace std; const int N = 200001; char a[N]; char b[N]; long long l[N];//1的前缀和 int main(void) { // freopen("output.txt","r",stdin); while(~scanf("%s%s", a+1, b+1)) { int i, j; memset(l, 0, sizeof(l)); int len1 = strlen(a+1); int len2 = strlen(b+1); long long ans = 0; if(len1 == len2)//如果两个字符串长度相等 { for(i = 1; i <= len1; i++) { ans += (a[i] != b[i]); } printf("%I64d\n", ans); continue; } for(i = 1; i <= len1; i++) { l[i] = l[i-1] + (a[i] == '1'); } int tmp = len2 - len1+1;//b字符串对应的最大值 if(tmp > len1) tmp = len1;//不会大于第一个字符串的长度 int temp = 1;//起点为1 int flag = 0;//标记是加还是减，0表示加，1表示减 for(i = 1; i <= len2; i++) { if(b[i] == '0') { int tm = i; if(tm > len1) tm = len1;//起始位置不会大于第一个字符串的长度 ans += l[tm] - l[tm-temp]; } else { int tm = i; if(tm > len1) tm = len1; ans += (tm - l[tm]) - (tm - temp - l[tm-temp]); } if(!flag) { if(temp < tmp) temp++; } else { temp--; } if(i == len2 - tmp) flag = 1; } printf("%I64d\n", ans); } return 0; }