求数据

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;

int n,q;
vector<pair<int,int>> d[5000000];
int main(){
    //freopen("replace4.in","r",stdin);
   // freopen("replace4.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        string str1,str2;
        cin>>str1>>str2;
        int pos1,pos2,len;
        pos1=str1.find('b');
        pos2=str2.find('b');
        len=str1.size();
        d[pos2-pos1+2500000].push_back(make_pair(pos1,len-pos2+1));
    }
    for(int i=1;i<=q;i++){
        string str1,str2;
        cin>>str1>>str2;
        if(str1.size()!=str2.size()){
            cout<<0<<endl;
            continue;
        }
        int pos1,pos2,ans=0;
        pos1=str1.find('b');
        pos2=str2.find('b');
        int l2=str1.size()-pos2+1;
        int t=pos2-pos1+2500000;
        for(auto j:d[t]){
            if(j.first<=pos1&&j.second<=l2)ans++;
        }
        cout<<ans<<endl;
    }
    return 0;
}