好字符题解 (字符串哈希与KMP模板) 河南萌新联赛2024第（二）场：南阳理工学院 E题

本题思路:

        把a一个字符串复制相同的一份接在自己后面的到串aa,只看某个特定的字母,b字符串如果是aa的子串,则该字母是好字符;

字符串哈希:

        1.进制数为131或者1331,模数直接用unsigned long long 使其自然溢出

        2.某个字符的哈希值不能为0,否则会出现 A的哈希值为0, AAA的哈希值也为0;

        字符串哈希模板:

        

#include <iostream>
#include <algorithm>

using namespace std;

typedef unsigned long long ULL;

const int N = 100010, P = 131;

int n, m;
char str[N];
ULL h[N], p[N];

ULL get(int l, int r)
{
    return h[r] - h[l - 1] * p[r - l + 1];
}

int main()
{
    scanf("%d%d", &n, &m);
    scanf("%s", str + 1);

    p[0] = 1;
    for (int i = 1; i <= n; i ++ )
    {
        h[i] = h[i - 1] * P + str[i];
        p[i] = p[i - 1] * P;
    }

    while (m -- )
    {
        int l1, r1, l2, r2;
        scanf("%d%d%d%d", &l1, &r1, &l2, &r2);

        if (get(l1, r1) == get(l2, r2)) puts("Yes");
        else puts("No");
    }

    return 0;
}

KMP模板

#include <iostream>

using namespace std;

const int N = 100010, M = 1000010;

int n, m;
int ne[N];
char s[M], p[N];

int main()
{
    cin >> n >> p + 1 >> m >> s + 1;

    for (int i = 2, j = 0; i <= n; i ++ )
    {
        while (j && p[i] != p[j + 1]) j = ne[j];
        if (p[i] == p[j + 1]) j ++ ;
        ne[i] = j;
    }

    for (int i = 1, j = 0; i <= m; i ++ )
    {
        while (j && s[i] != p[j + 1]) j = ne[j];
        if (s[i] == p[j + 1]) j ++ ;
        if (j == n)
        {
            printf("%d ", i - n);
            j = ne[j];
        }
    }

    return 0;
}

字符串哈希AC代码:

#include<bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
const int P=131,N=1e9+10;

void solve(){
	int n;
	cin>>n;
	string a,b;
	cin>>a>>b;
	a=' '+a+a;
	b=' '+b;
	string aa=a,bb=b;

	int ans = 0;
	for(int z = 0; z < 26; z++){
		a=aa,b=bb;
		int ipp = 0;
		for(int j = 1; j <= 2*n; j++){
			if( a[j] != 'a' + z) a[j] = '*';
			if( j<=n && b[j] != 'a' + z) b[j] = '*';
			if( a[j] == 'a' + z)ipp=1;
		}
		if(!ipp)continue;
		vector<ULL>ha(2*n+1),hb(n+1),p(2*n+1);
		p[0]=1;
		
		for(int i=1;i<=2*n;i++){
			ha[i]=ha[i-1]*P+a[i];
			if(i<=n)hb[i]=hb[i-1]*P+b[i];
			p[i]=p[i-1]*P;
		}
		auto get = [&](int l, int r,int z){
			return z?ha[r]-ha[l-1]*p[r-l+1]:hb[r]-hb[l-1]*p[r-l+1];
		};
		ULL t=get(1, n, 0);
		int ip = 0;
		for(int j=n;j<=2*n;j++){
			ULL tt=get(j-n+1, j, 1);
			if(tt == t)ip = 1;
		}
		if(ip)ans++;


	}

	cout<<ans<<endl;

}
int main(){
	int T;
	T=1;
	while(T--){
		solve();
	}
	return 0;
}

KMP AC代码

#include<bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
const int P=131,N=1e9+10;

void solve(){
	int n;
	cin>>n;
	string a,b;
	cin>>a>>b;
	a=' '+a+a;
	b=' '+b;

	int ans = 0;
	for(int z = 0; z < 26; z++){
		vector<int> ne(n+1);
		int ipp = 0;
		auto pan = [&](int x, int y){
			return (x == z + 'a') == (y == z + 'a');
		};
		for(int i = 2,j = 0;i <= n; i++){
			while(j && !pan(b[i], b[j + 1]))j = ne[j];
			if(pan(b[i], b[j + 1])) j++;
			if(b[i] == z + 'a')ipp=1;
			ne[i] = j;
		}
		if(b[1] == z + 'a') ipp = 1;
		if(!ipp) continue;
		int ip = 0;
		for(int i = 1, j = 0; i <= 2*n; i++){
			while(j && !pan(a[i], b[j + 1])) j = ne[j];
			if(pan(a[i], b[j + 1])) j++;
			if(j == n){
				ip=1;
				j = ne[j];
			}
		}
		if(ip) ans++;
	}



	cout<<ans<<endl;

}
int main(){
	int T;
	T=1;
	while(T--){
		solve();
	}
	return 0;
}