【ural】1996. Cipher Message 3【FFT+KMP】

传送门：【ural】1996. Cipher Message 3

题目大意：

问至少将多少个$A$串的字节的最低位取反使得$B$串是$A$串的子串。

题目分析：

可以发现，只要将$B$串翻转一下，$A$串和$B$串的匹配就符合一个卷积公式了。令$a_i$为A串第$i$个字节的最低位，$b_j$为B串第$j$个字节的最低位（$a_i,b_j\in \{0,1\}$）。

$A$串用多项式表示为：
$\qquad\qquad A = \sum_{i=1}^n x^i=\sum_{i=1}^n A(i)$

$B$串用多项式表示为：
$\qquad\qquad B = \sum_{i=1}^m y^i=\sum_{i=1}^m B(i)$

则$A$串从第$l$位开始和$B$串匹配的代价是：
$\qquad\qquad Cost(l+m)=\sum_{i=1}^{m}\{a_i \not= b_i\}A(l+(i-1)) \cdot B(m-(i-1))$

这代价我们用卷积就可以求得。

接下来一个关键的问题就是判定哪些$A$串的位置可以和$B$串匹配，这个我们需要取其前七位，然后跑一遍$KMP$就可以了。

$my~~code:$

#include <stdio.h>
#include <string.h>
#include <set>
#include <map>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std ;

typedef long long LL ;

#define clr( a , x ) memset ( a , x , sizeof a )
#define cpy( a , x ) memcpy ( a , x , sizeof a )
#define clrs( a , x , size ) memset ( a , x , sizeof ( a[0] ) * ( size ) )
#define cpys( a , x , size ) memcpy ( a , x , sizeof ( a[0] ) * ( size ) )

const int MAXN = 600000 ;
const int INF = 0x3f3f3f3f ;
const double pi = acos ( -1.0 ) ;

struct Complex {
    double r , i ;
    Complex () {}
    Complex ( double r , double i ) : r ( r ) , i ( i ) {}
    Complex operator + ( const Complex& p ) const {
        return Complex ( r + p.r , i + p.i ) ;
    }
    Complex operator - ( const Complex& p ) const {
        return Complex ( r - p.r , i - p.i ) ;
    }
    Complex operator * ( const Complex& p ) const {
        return Complex ( r * p.r - i * p.i , r * p.i + i * p.r ) ;
    }
} ;

Complex x1[MAXN] , x2[MAXN] ;
int s[MAXN] , p[MAXN] ;
int cost[MAXN] ;
int fail[MAXN] ;
int n , m ;
int ans1 , ans2 ;

void FFT ( Complex y[] , int n , int rev ) {
    for ( int i = 1 , j , k , t ; i < n ; ++ i ) {
        for ( j = 0 , t = i , k = n >> 1 ; k ; k >>= 1 , t >>= 1 ) {
            j = j << 1 | t & 1 ;
        }
        if ( i < j ) swap ( y[i] , y[j] ) ;
    }
    for ( int s = 2 , ds = 1 ; s <= n ; ds = s , s <<= 1 ) {
        Complex wn ( cos ( rev * 2 * pi / s ) , sin ( rev * 2 * pi / s ) ) ;
        for ( int k = 0 ; k < n ; k += s ) {
            Complex w ( 1 , 0 ) , t ;
            for ( int i = k ; i < k + ds ; ++ i ) {
                y[i + ds] = y[i] - ( t = w * y[i + ds] ) ;
                y[i] = y[i] + t ;
                w = w * wn ;
            }
        }
    }
    if ( rev < 0 ) {
        for ( int i = 0 ; i < n ; ++ i ) {
            y[i].r /= n ;
        }
    }
}

void calc ( int n , int m , int n1 , int x , int y ) {
    for ( int i = 0 ; i < n1 ; ++ i ) {
        x1[i] = Complex ( i < n ? ( s[i] & 1 ) == x : 0 , 0 ) ;
        x2[i] = Complex ( i < m ? ( p[m - i - 1] & 1 ) == y : 0 , 0 ) ;
    }
    FFT ( x1 , n1 , 1 ) ;
    FFT ( x2 , n1 , 1 ) ;
    for ( int i = 0 ; i < n1 ; ++ i ) {
        x1[i] = x1[i] * x2[i] ;
    }
    FFT ( x1 , n1 , -1 ) ;
    for ( int i = 0 ; i < n1 ; ++ i ) {
        cost[i] += ( int ) ( x1[i].r + 0.5 ) ;
    }
}

void get_fail () {
    fail[1] = 0 ;
    for ( int i = 2 , j = 0 ; i <= m ; ++ i ) {
        while ( j && p[i] != p[j + 1] ) j = fail[j] ;
        if ( p[i] == p[j + 1] ) ++ j ;
        fail[i] = j ;
    }
}

void kmp () {
    for ( int i = 1 , j = 0 ; i <= n ; ++ i ) {
        while ( j && s[i] != p[j + 1] ) j = fail[j] ;
        if ( s[i] == p[j + 1] ) {
            ++ j ;
            if ( j == m ) {
                if ( ans1 > cost[i - 1] ) {
                    ans1 = cost[i - 1] ;
                    ans2 = i - m + 1 ;
                }
                j = fail[j] ;
            }
        } else j = fail[j] ;
    }
}

void solve () {
    int n1 = 1 ;
    ans1 = ans2 = INF ;
    while ( n1 < n + m - 1 ) n1 <<= 1 ;
    clr ( cost , 0 ) ;
    for ( int i = 0 ; i < n ; ++ i ) {
        scanf ( "%d" , &s[i] ) ;
    }
    for ( int i = 0 ; i < m ; ++ i ) {
        scanf ( "%d" , &p[i] ) ;
    }
    calc ( n , m , n1 , 0 , 1 ) ;
    calc ( n , m , n1 , 1 , 0 ) ;
    for ( int i = n ; i >= 1 ; -- i ) {
        s[i] = s[i - 1] / 10 ;
    }
    for ( int i = m ; i >= 1 ; -- i ) {
        p[i] = p[i - 1] / 10 ;
    }
    get_fail () ;
    kmp () ;
    if ( ans1 == INF ) {
        printf ( "No\n" ) ;
    } else {
        printf ( "Yes\n" ) ;
        printf ( "%d %d\n" , ans1 , ans2 ) ;
    }
}

int main () {
    while ( ~scanf ( "%d%d" , &n , &m ) ) solve () ;
    return 0 ;
}