相似子串

两个字符串相似定义为：
1.两个字符串长度相等
2.两个字符串对应位置上有且仅有 至多一个位置所对应的字符不相同
给定一个字符串，每次询问两个子串在给定的规则下是否相似。给定的规则指每次给出一些等价关系，如‘a'=’b'，‘b'=’c'等，注意这里的等价关系具有传递性，即若‘a'=’b'，‘b'=’c'，则‘a'=’c'。

Input

第一行一个字符串s(1<=|s|<=300000)
第二行一个整数T(1<=T<=300000)
对于每次询问：
第一行5个整数k，l1，r1，l2，r2，表示有k个等价规则，询问的是子串[l1,r1],[l2,r2](1<=k<=10,1<=l1<=r1<=|s|,1<=l2<=r2<=|s|)
接下来k行每行两个连续的字符表示这两个字符等价。
此题中所有的字符均为小写字母。

Output

T行，若相似则输出“YES”否则输出“NO”

Input示例

abac
3
1 1 2 3 4
bc
1 1 2 3 4
ac
1 1 2 2 3
ac

Output示例

YES
YES

NO

#include<bits/stdc++.h>
const int MOD =  6999983;
typedef long long ll;
using namespace std;
inline int read()
{
    int x = 0;
    char ch = getchar();
    while (ch<'0'||ch>'9') 
    {
        ch = getchar();
    }
    while (ch>='0'&&ch<='9')
    {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}

int n, a1[30], a2[30], f[30], sum1[300005][27], fac1[300005], fac2[300005];
int b1[300005], b2[300005], sum2[300005][27];
char s[300005];
bool Hash1[7000005], Hash2[7000005];

int find(int i)
{
    if (f[i] != i) 
    {
        f[i] = find(f[i]);
    }
    
    return f[i];
}

void Union(int a, int b)
{
    int r1 = find(a);
    int r2 = find(b);
    if (r1 != r2)
    {
        f[r1] = r2;
        a1[r2] = (a1[r2] + a1[r1]) % MOD;
        a2[r2] = (a2[r2] + a2[r1]) % MOD;
        b1[r2] = (b1[r2] + b1[r1]) % MOD;
        b2[r2] = (b2[r2] + b2[r1]) % MOD;
    }
}

inline void solve()
{
    int k = read();
    int l1 = read();
    int r1 = read();
    int l2 = read();
    int r2 = read();
    if (r1 - l1 != r2 - l2)
    {
        puts("NO");
        return;
    }
    for (int i = 1; i <= 26; i++)
    {
        f[i] = i;
        a1[i] = (sum1[r1][i] - sum1[l1-1][i] + MOD) % MOD;
        a2[i] = (sum1[r2][i] - sum1[l2-1][i] + MOD) % MOD;
        b1[i] = (sum2[r1][i] - sum2[l1-1][i] + MOD) % MOD;
        b2[i] = (sum2[r2][i] - sum2[l2-1][i] + MOD) % MOD;

        if (l1 < l2)
        {
            a1[i] = (ll)a1[i] * fac1[l2 - l1] % MOD;
        }
        else
        {
            a2[i] = (ll)a2[i] * fac1[l1 - l2] % MOD;
        }
        if (l1 < l2)
        {
            b1[i] = (ll)b1[i] * fac2[l2-l1] % MOD;
        }
        else
        {
            b2[i] = (ll)b2[i] * fac2[l1-l2] % MOD;
        }
    }
    char ch[5];
    while (k--)
    {
        scanf("%s", ch);
        Union(ch[0] - 'a' + 1, ch[1] - 'a' + 1);
    }
    int flag = 0, ans1 = 0, ans2 = 0;
    for (int i = 1; i <= 26; i++)
    {
        if (f[i] != i)
        {
            continue;
        }
        if (a1[i] != a2[i])
        {
            flag++;
            ans1 = (a2[i] - a1[i] + MOD) % MOD;
            ans2 = (b2[i] - b1[i] + MOD) % MOD;
            if (flag > 2)
            { 
                puts("NO");
                return;
            }
            if (!((Hash1[ans1] && Hash2[ans2]) || (Hash1[MOD - ans1] && Hash2[MOD - ans2])))
            {
                puts("NO");
                return;
            }
        }
    }
    puts("YES");
}

int main()
{
    scanf("%s",s + 1);
    n = strlen(s + 1);
    fac1[0] = fac2[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        fac1[i] = (ll)fac1[i-1] * 29 % MOD;
        Hash1[fac1[i]] = true;
        fac2[i] = (ll)fac2[i-1] * 47 % MOD;
        Hash2[fac2[i]] = true;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= 26; j++)
        {
            sum1[i][j] = sum1[i-1][j] + (s[i] == (char)('a' + j - 1)) * fac1[i];
            sum1[i][j] %= MOD;
            sum2[i][j] = sum2[i-1][j] + (s[i] == (char)('a' + j - 1)) * fac2[i];
            sum2[i][j] %= MOD;
        }
    }
    int Case = read();
    while (Case--)
    {
        solve();
    }
    
    return 0;
}