【POJ 2001 Shortest Prefixes】+ 字典树
来源:互联网 发布:九九乘法表 java 编辑:程序博客网 时间:2024/06/01 10:28
Shortest Prefixes
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 17793 Accepted: 7737
Description
A prefix of a string is a substring starting at the beginning of the given string. The prefixes of “carbon” are: “c”, “ca”, “car”, “carb”, “carbo”, and “carbon”. Note that the empty string is not considered a prefix in this problem, but every non-empty string is considered to be a prefix of itself. In everyday language, we tend to abbreviate words by prefixes. For example, “carbohydrate” is commonly abbreviated by “carb”. In this problem, given a set of words, you will find for each word the shortest prefix that uniquely identifies the word it represents.
In the sample input below, “carbohydrate” can be abbreviated to “carboh”, but it cannot be abbreviated to “carbo” (or anything shorter) because there are other words in the list that begin with “carbo”.
An exact match will override a prefix match. For example, the prefix “car” matches the given word “car” exactly. Therefore, it is understood without ambiguity that “car” is an abbreviation for “car” , not for “carriage” or any of the other words in the list that begins with “car”.
Input
The input contains at least two, but no more than 1000 lines. Each line contains one word consisting of 1 to 20 lower case letters.
Output
The output contains the same number of lines as the input. Each line of the output contains the word from the corresponding line of the input, followed by one blank space, and the shortest prefix that uniquely (without ambiguity) identifies this word.
Sample Input
carbohydrate
cart
carburetor
caramel
caribou
carbonic
cartilage
carbon
carriage
carton
car
carbonate
Sample Output
carbohydrate carboh
cart cart
carburetor carbu
caramel cara
caribou cari
carbonic carboni
cartilage carti
carbon carbon
carriage carr
carton carto
car car
carbonate carbona
找到最短且唯一的前缀~~裸字典树
AC代码:
#include<cstdio>#include<cstring>using namespace std;const int MAX = 1e4 + 10;char st[1010][30];int ch[MAX][30],word[MAX],sz,n = 0;void init(){ sz = 1; memset(ch[0],0,sizeof(ch[0])); memset(word,0,sizeof(word));}void inse(char *s){ int nl = strlen(s),u = 0; for(int i = 0 ; i < nl ; i++){ int c = s[i] - 'a'; if(! ch[u][c]) ch[u][c] = sz++; u = ch[u][c]; word[u]++; }}void find(char *s){ int nl = strlen(s),u = 0; for(int i = 0 ; i < nl ; i++){ int c = s[i] - 'a'; u = ch[u][c]; printf("%c",s[i]); if(word[u] == 1) return ; //当前前缀已满足题意 }}int main(){ init(); while(scanf("%s",st[++n]) != EOF) inse(st[n]); for(int i = 1 ; i <= n; i++){ printf("%s ",st[i]); find(st[i]); printf("\n"); } return 0;}
- POJ 2001:Shortest Prefixes(字典树)
- poj 2001 Shortest Prefixes(字典树)
- poj 2001 -- Shortest Prefixes ( 字典树 )
- POJ 2001 Shortest Prefixes ( 字典树 )
- POJ 2001 Shortest Prefixes 字典树Trie
- POJ 2001 Shortest Prefixes(字典树Trie)
- poj 2001 Shortest Prefixes(字典树)
- [字典树] poj 2001 Shortest Prefixes
- POJ 2001 Shortest Prefixes 字典树
- POJ 2001-Shortest Prefixes(字典树)
- POJ 2001 Shortest Prefixes(字典树)
- POJ 2001 Shortest Prefixes(字典树)
- POJ【2001】Shortest Prefixes----字典树
- POJ-2001--Shortest Prefixes (字典树)
- poj 2001 Shortest Prefixes 字典树
- poj 2001 Shortest Prefixes(字典树)
- poj 2001 Shortest Prefixes(字典树)
- POJ - 2001 - Shortest Prefixes (字典树!!)
- redhat虚拟机安装jdk1.8和tomcat8
- FutureTask和线程池的结合使用
- log4j配置详解
- 售票问题
- IT技术学习指导之Linux系统入门的4个阶段
- 【POJ 2001 Shortest Prefixes】+ 字典树
- 使用fsdbdebug抽取fsdb文件中的信号列表
- HBase插入和读取图片
- JAVA加密解密之DSA(Digital Signature Algorithm)算法
- storm
- hdu4339query
- 关于老赵让改成bootstrap框架搭建的过程
- OpenGL之路(一)OpenGL、gl、glu、glut的区别 + glut环境的搭建
- hive数据倾斜原因和解决方法