F. Isomorphic Strings

仔细读题后发现就是每个字母对应的f都要相同。
那么就把每个字母单独提出来处理即可。
然后找到第一个该字符所匹配的字母，然后看两串是否相同
hash即可
c++代码如下：

#include<bits/stdc++.h>
#define lowbit(x) (x & -x)
#define rep(i,x,y) for(register int i = x ;i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    char c;int sign = 1;x = 0;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 2e5 + 20,mod = 998244353;
int n,m,nxt[N][27],lst[27];
char s[N]; ll h[N][27],p[N];

inline void pre()
{
    rep(j,'a','z') rep(i,1,n)
        h[i][j - 'a'] = (h[i-1][j - 'a'] * 233 + (s[i] == j)) % mod;

    rep(i,'a','z') lst[i - 'a'] = n + 1;
    repd(i,n,1)
    {
        lst[s[i] - 'a'] = i;
        rep(j,'a','z') nxt[i][j - 'a'] = lst[j - 'a'];
    }

    p[0] = 1;
    rep(i,1,n)  p[i] = (p[i - 1]*233) % mod;
}

inline bool judge(int w,int x,int y,int len) 
{
    int v = nxt[x][w];

    if(v >= x + len) return true;

    v = s[y + v - x] - 'a';

    return ((h[x + len - 1][w] - h[x - 1][w] * p[len])%mod + mod) % mod ==
        ((h[y + len - 1][v] - h[y - 1][v] * p[len])%mod + mod) % mod;
}

inline bool check(int x,int y,int len)
{
    rep(i,'a','z')
        if(!judge(i - 'a',x,y,len)) return false;
    return true;
}

int main()
{
    read(n); read(m);
    scanf("%s" ,s + 1);
    pre();
    rep(i,1,m)
    {
        int x,y,len;
        read(x); read(y); read(len);
        if(x > y) swap(x,y);
        puts(check(x,y,len) ? "YES" : "NO" );
    }

    return 0;
}