单词数

最新推荐文章于 2020-02-07 17:10:51 发布

原创最新推荐文章于 2020-02-07 17:10:51 发布 · 177 阅读

0 ·

CC 4.0 BY-SA版权

字典树专栏收录该内容

11 篇文章

订阅专栏

本文解析了一道来自HDU ACM在线评测系统的字符串匹配题目，采用Trie树进行字符串的高效存储与检索。通过逐行读取输入并利用Trie树进行插入操作，实现了对不同单词的计数。代码中详细展示了Trie树节点的定义、插入和查找过程。

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

http://acm.hdu.edu.cn/showproblem.php?pid=2072

/*#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>*/
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------



//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
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 * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------




const int maxn=2e6+9;
const int mod=1e9+7;

int tree[maxn][39],sum[maxn];
bool flagg[maxn];
int tot;

int ans=0;
void insert_str(char *str)
{
    int len=strlen(str);
    int rt=0;
    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';
        if(!tree[rt][id]) tree[rt][id]=++tot;
        rt=tree[rt][id];
    }
    if(!flagg[rt]) ans++;
    flagg[rt]=1;
}
int find_str(char *str)
{
    int len=strlen(str);
    int rt=0;
    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';
        if(!tree[rt][id]) return 0;
        rt=tree[rt][id];
    }
    return sum[rt];
}
void init()
{
    for(int i=0;i<=tot;i++)
    {
        flagg[i]=0;
        for(int j=0;j<30;j++) tree[i][j]=0;
    }
    tot=0;
}
char s[maxn];
char tmp[maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);




    while(gets(s))
    {
        if(s[0]=='#')
        {
            break;
        }
        init();
        ans=0;
        int cnt=0;
        int len=strlen(s);
        for(int i=0;i<len;i++)
        {
            if(s[i]==' '&&!cnt) continue;
            if(s[i]==' '&&cnt)
            {
                tmp[cnt]='\0';
                insert_str(tmp);
                //cout<<tmp<<endl;
                cnt=0;
                continue;
            }
            else
            {
                tmp[cnt]=s[i];
                cnt++;
            }
        }
        if(cnt) insert_str(tmp);
       // cout<<tmp<<endl;;
       printf("%d\n",ans);
    }

    return 0;
}