Beautiful Substrings Gym - 101972H

https://vjudge.net/problem/Gym-101972H

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

int sum[maxn][30];
bool vis[30][30];
vector<pair<int,int> >vec;
char s[maxn],t[maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    sfi(T);
    while(T--)
    {
        vec.clear();
        mem(vis,0);
        int n,m,k;
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<=m;i++)
        {
            for(int j=0;j<26;j++) sum[i][j]=0;
        }

        scanf("%s%s",s+1,t+1);

        for(int i=1;i+k-1<=n;i++)
        {
            if(!vis[s[i]-'a'][s[i+k-1]-'a'])
            {
                //printf("%c %c\n",s[i],s[i+k-1]);
                vec.pb({s[i]-'a',s[i+k-1]-'a'});
                vis[s[i]-'a'][s[i+k-1]-'a']=1;
            }

        }
        ll ans=0;
        for(int i=1;i<=m;i++)
        {
            int id=t[i]-'a';
            for(int j=0;j<26;j++)
            {
                sum[i][j]=sum[i-1][j];
            }
            sum[i][id]++;


            for(int j=0;j<vec.size();j++)
            {
                int id2=vec[j].second;
                int id3=vec[j].first;
                if(id==id2)
                {
                    ans+=(ll)sum[i][id3];
                }
            }
            for(int j=0;j<26;j++)
            {
                sum[i][j]=sum[i-1][j];
            }
            sum[i][id]++;
        }
        printf("%I64d\n",ans);

    }



    return 0;
}