统计难题
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)
Total Submission(s): 52670 Accepted Submission(s): 18415
Problem Description
Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).
Input
输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串.
注意:本题只有一组测试数据,处理到文件结束.
Output
对于每个提问,给出以该字符串为前缀的单词的数量.
Sample Input
banana
band
bee
absolute
acm
ba
b
band
abc
Sample Output
2
3
1
0
Author
Ignatius.L
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1075 1247 1671 1298 1800
做法:字典树模板练习
代码如下:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#define N 400007
using namespace std;
int t[N][26], r[N];
int n, m, tot;
char s[11];
void insert()
{
int len = strlen(s);
int root = 0;
for (int i = 0; i <= len - 1; i++)
{
int id = s[i] - 'a';
if (!t[root][id]) t[root][id] = ++tot;
root = t[root][id];
r[root]++;
}
}
int search()
{
int len = strlen(s);
int root = 0;
for (int i = 0; i <= len - 1; i++)
{
int id = s[i] - 'a';
if (!t[root][id]) return 0;
root = t[root][id];
}
return r[root];
}
int main()
{
bool p = 0;
while (gets(s))
{
if (!p)
{
if (strlen(s)) insert();
else p = 1;
}
else printf("%d\n", search());
}
}