hihocoder 1107 Shortest Proper Prefix
来源:互联网 发布:js中undefined怎么赋值 编辑:程序博客网 时间:2024/06/11 17:51
1107 : Shortest Proper Prefix
时间限制:10000ms
单点时限:1000ms
内存限制:512MB
描述
Query auto-completion(QAC) is widely used in many search applications. The basic idea is that when you type some string s in the search box several high-frequency queries which have s as a prefix are suggested. We say string s1 has string s2 as a prefix if and only if the first |s2| characters of s1 are the same as s2 where |s2| is the length of s2.
These days Little Hi has been working on a way to improve the QAC performance. He collected N high-frequency queries. We say a string s is a proper prefix if there are no more than 5 collected queries have s as a prefix. A string s is a shortest proper prefix if s is a proper prefix and all the prefixes of s(except for s itself) are not proper prefixes. Little Hi wants to know the number of shortest proper prefixes given N collected queries.
Hint: the 4 shortest proper prefixes for Sample Input are “ab”, “bb”, “bc” and “be”. Empty string “” is not counted as a proper prefix even if N <= 5.
输入
The first line contains N(N <= 10000), the number of collected queries.
The following N lines each contain a query.
Each query contains only lowercase letters ‘a’-‘z’.
The total length of all queries are no more than 2000000.
Input may contain identical queries. Count them separately when you calculate the number of queries that have some string as a prefix.
输出
Output the number of shortest proper prefixes.
样例输入
12
a
ab
abc
abcde
abcde
abcba
bcd
bcde
bcbbd
bcac
bee
bbb
样例输出
4
//trie树
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <algorithm>#include <map>#include <vector>using namespace std;struct trie{ //建立一颗字典树 char key; int num; trie *next[26]; trie(){ num = 0; for(int i = 0; i < 26; i++) next[i] = NULL; }};trie root;//创建根节点void ins(string s) { //插入新单词 trie *head = &root; for(int i = 0; i < s.size(); i++) { int k = s[i] - 'a'; if(head->next[k] == NULL) { trie *node = new trie; node->key = s[i]; head->next[k] = node; } head = head->next[k]; head->num++; }}int ans = 0; //题目所述proper prefix的个数map<trie *,int>k; //建立一个映射,后面会用到void bia(trie *head) {//遍历字典树 for(int i = 0; i < 26; i++) { int flag = 0; if(head->num <= 5 &&head != &root) {//满足条件的节点 if(k[head] != 1)//若此节点之前未统计过 ans++; flag = 1; //标记,此节点后面的分支都不用再遍历了 k[head] = 1;//已统计过的节点,标记一下 } //不是最后一个节点且前面还没遇到满足条件的节点 if(head->next[i] != NULL && !flag) bia(head->next[i]);//递归 }}int main(){ string s; int n,m; cin >> n; while(n--) { cin >> s; ins(s); } trie *head = &root; bia(head); cout << ans; return 0;}
- hihocoder #1107 : Shortest Proper Prefix
- hihocoder 1107 Shortest Proper Prefix
- hihocoder 1107 : Shortest Proper Prefix
- hihocoder 1107 : Shortest Proper Prefix
- #1107 : Shortest Proper Prefix
- hihoCoder 1107 Shortest Proper Prefix (字典树的遍历)
- hihoCoder 1107 Shortest Proper Prefix 微软苏州校招笔试 1月17日
- Shortest Proper Prefix
- Shortest Proper Prefix---Trie树
- 微软笔试题-Shortest Proper Prefix
- hihoCoder1107 Shortest Proper Prefix Tire树
- poj 2001 shortest prefix
- POJ 2001 Shortest Prefix
- Shortest unique prefix
- Poj 2001 Shortest Prefix(字典树模板)
- proper fraction
- Proper Nutrition
- prefix
- 从request获取各种路径总结 request.getRealPath("url"); // 虚拟目录映射为实际目录 request.getRealPat
- MySQL常用命令
- Android中的AlarmManager的使用
- hdoj 蟠桃记
- typedef struct和struct的区别
- hihocoder 1107 Shortest Proper Prefix
- Netlink实现网卡上下线监控
- SQL Demo
- 南理OJ_单调递增最长子序列
- 《代码整洁之道》学习笔记(二)
- shell脚本中if判断的一些参数及含义
- 过游戏保护驱动
- Android中visibility属性VISIBLE、INVISIBLE、GONE的区别
- struct sockaddr与struct sockaddr_in的区别和联系