我是妹子，刚学OI。全部WA显示too long，求大佬看一下谢谢

#include<cstdio>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
#define rgi register int 
#define maxn 100005
#define N 500005
using namespace std;
int n,m,trie[N][100],tot,ans[maxn];
string s;
bitset<N>num[1005];
inline int read()
{
    int x=0,f=1;
    char c=getchar();
    for(;!isdigit(c);c=getchar())
        if(c=='-')
            f=-1;
    for(;isdigit(c);c=getchar())
        x=(x<<3)+(x<<1)+c-'0';
    return x*f;
}
void upd(int k,string s)
{
    int p=0;
    for(int i=0;i<s.size();i++)
    {
        if(!trie[p][s[i]-'A'])
            trie[p][s[i]-'A']=++tot;
        p=trie[p][s[i]-'A'];
    }
    num[k][p]=1;
}
inline bool check(int k,string s)
{
    int p=0;
    for(int i=0;i<s.size();i++)p=trie[p][s[i]-'A'];
    return num[k][p];
}
int main()
{
    n=read();
    for(rgi i=1;i<=n;++i)
    {
        m=read();
        for(rgi j=1;j<=m;j++)
        {
            cin>>s;
            upd(i,s);
        }
    }
    m=read();
    for(rgi i=1;i<=m;++i)
    {
        cin>>s;
        int tmp=0;
        for(rgi j=1;j<=n;j++)
        {
            if(check(j,s))
                ans[++tmp]=j;
        }
        for(rgi j=1;j<tmp;++j)
            cout<<ans[j]<<" ";
        if(tmp>=1)cout<<ans[tmp];
        puts(" ");
    }
    return 0;
}