#include <iostream>
using namespace std;
const int N = 100010;
struct Trie{
int son[N][26], cnt[N], idx;
char str[N];
void insert(char* str)
{
int p = 0;
for (int i = 0; str[i]; i++)
{
int u = str[i] - 'a';
if (!son[p][u]) son[p][u] = ++idx;
p = son[p][u];
}
cnt[p] ++;
}
int query(char* str)
{
int p = 0;
for (int i = 0; str[i]; i++)
{
int u = str[i] - 'a';
if (!son[p][u]) return 0;
p = son[p][u];
}
return cnt[p];
}
}trie;
int main()
{
int n;
scanf("%d", &n);
while (n--)
{
char op[2];
scanf("%s%s", op, trie.str);
if (*op == 'I') trie.insert(trie.str);
else printf("%d\n", trie.query(trie.str));
}
return 0;
}
Trie模板
最新推荐文章于 2024-09-07 23:15:53 发布