作者:
fangy
,
2023-03-17 21:04:51
,
所有人可见
,
阅读 4
#include <iostream>
using namespace std;
const int N = 100010;
char str[N];
int son[N][26], cnt[N], idx;
void insert(char str[])
{
int p = 0;
for (int i = 0; str[i]; ++i)
{
int t = str[i] - 'a';
if (!son[p][t]) son[p][t] = ++idx;
p = son[p][t];
}
cnt[p]++;
}
int query(char str[])
{
int p = 0;
for (int i = 0; str[i]; ++i)
{
int t = str[i] - 'a';
if (!son[p][t]) return 0;
p = son[p][t];
}
return cnt[p];
}
int main()
{
int n;
cin >> n;
while (n--)
{
char op[2];
scanf("%s%s", op, str);
if (op[0] == 'I') insert(str);
else printf("%d\n", query(str));
}
return 0;
}