集训队专题（1）1008 Repository

最新推荐文章于 2024-03-05 16:26:39 发布

RaAlGhul

最新推荐文章于 2024-03-05 16:26:39 发布

阅读量581

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM_字典树(Trie树）

本文链接：https://blog.youkuaiyun.com/RaAlGhul/article/details/50594476

ACM_字典树(Trie树）专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一道关于字符串匹配的编程题目，通过构建字典树的方式实现高效查询，包括输入输出说明、样例输入输出及代码实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Repository

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)

Total Submission(s) : 88 Accepted Submission(s) : 18

Problem Description

When you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give the search system a name about something, then the system responds with the results. Now you are given a lot merchandise names in repository and some queries, and required to simulate the process.

Input

There is only one case. First there is an integer P (1<=P<=10000)representing the number of the merchanidse names in the repository. The next P lines each contain a string (it's length isn't beyond 20,and all the letters are lowercase).Then there is an integer Q(1<=Q<=100000) representing the number of the queries. The next Q lines each contains a string(the same limitation as foregoing descriptions) as the searching condition.

Output

For each query, you just output the number of the merchandises, whose names contain the search string as their substrings.

Sample Input

20
ad
ae
af
ag
ah
ai
aj
ak
al
ads
add
ade
adf
adg
adh
adi
adj
adk
adl
aes
5
b
a
d
ad
s

Sample Output

Source

2009 Multi-University Training Contest 4 - Host by HDU

此题和之前的那道“统计难题”很像，所以这里我们仍然采用数组模拟的方法来解决这道题，如果之前“统计难题”看懂了做出来了，那这道题对于我们来说，就是略微加强一点的水题啦（小编~）。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
using namespace std;
struct node
{
    int id;   
    int cnt;
    int al[26];
};
int ptr=0;
node word[1000000];
void Init(int z)
{     
    for(int i=0;i<26;i++)
        word[z].al[i]=-1;      
}      
void Insert(char*s,int len,int x)
{
    int now=0;
    for(int i=0;i<len;i++)  
    {
        if(word[now].al[s[i]-'a']==-1)
        {
            word[now].al[s[i]-'a']=++ptr;
            Init(ptr);
			now=ptr;
        }
        else now=word[now].al[s[i]-'a'];
        if(word[now].id!=x) word[now].cnt++;
        word[now].id=x;
    }
}
int find(char*s)
{
    int now=0;
    int len=strlen(s);
    for(int i=0;i<len;i++)
    {
        if(word[now].al[s[i]-'a']==-1)
            return 0;
        now=word[now].al[s[i]-'a'];
    }
    return word[now].cnt;
}                                                                        
int main()
{
    int n,m,len;
    char s[21];
    Init(0);
    scanf("%d",&n);
    while(n--)
    {      
        scanf("%s",&s);
        len=strlen(s);
        for(int i=0;i<len;i++)
            Insert(s+i,len-i,n+1);
    }
    scanf("%d",&m);
    while(m--)
    {
        scanf("%s",&s);
        printf("%d\n",find(s));
    }                            
    return 0;
}