http://acm.hdu.edu.cn/showproblem.php?pid=1251
题目大意:
中文题不解释
分析:
字典树模板题, 没有坑, 直接写就ok
AC代码:
#include <bits/stdc++.h>
#define mset(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 400005;
int cnt = 0;
int tire[N][30];
string str;
int sum[N];
void insert() {
int rt = 0;
int len = str.length();
for (int i = 0; i < len; i++) {
int Index = str[i] - 'a';
if (!tire[rt][Index]) {
tire[rt][Index] = cnt++;
}
sum[tire[rt][Index]]++;
rt = tire[rt][Index];
}
}
int find() {
int rt = 0;
int len = str.length();
for (int i = 0; i < len; i++) {
int Index = str[i] - 'a';
if (!tire[rt][Index]) {
return 0;
}
rt = tire[rt][Index];
}
return sum[rt];
}
int main() {
std::ios::sync_with_stdio(false);
cnt = 1;
mset(sum, 0);mset(tire, 0);
while(1) {
getline(cin, str);
if (str.length() == 0) break;
insert();
}
while (cin >> str) {
if (str.length() == 0) break;
cout << find() << endl;
}
return 0;
}