题目链接:点击进入
题目
思路
字典树,对于每个节点,记录一个以该节点为前缀的字符串数目 sum ,在插入的时候,每经过一个存在的节点,该节点 sum++ ,若该节点不存在,创建节点后,sum 赋初值 1
代码
// Problem: 统计难题
// Contest: Virtual Judge - HDU
// URL: https://vjudge.net/problem/HDU-1251
// Memory Limit: 131 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=998244353;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
int k = 0, f = 1 ;
char c = getchar() ;
while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
return k * f ;
}
/*--------------------------------------------*/
int n,m,tot;
struct node
{
int sum;
int next[26];
}t[maxn];
void insert(string str)
{
int len=str.size(),p=0;
for(int i=0;i<len;i++)
{
int to=str[i]-'a';
if(t[p].next[to]==0)
{
t[p].next[to]=++tot;
p=t[p].next[to];
t[p].sum=1;
}
else
{
p=t[p].next[to];
t[p].sum++;
}
}
}
int find(string str)
{
int len=str.size(),p=0;
for(int i=0;i<len;i++)
{
int to=str[i]-'a';
if(t[p].next[to]==0)
return 0;
else
p=t[p].next[to];
}
return t[p].sum;
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
string s;
while(getline(cin,s))
{
if(s=="") break;
insert(s);
}
while(cin>>s)
{
if(s=="") break;
cout<<find(s)<<endl;
}
return 0;
}