poj2001 Shortest Prefixes
来源:互联网 发布:有什么编程软件 编辑:程序博客网 时间:2024/06/05 00:25
Shortest Prefixes
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16357 Accepted: 7096
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".
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
carbohydratecartcarburetorcaramelcariboucarboniccartilagecarboncarriagecartoncarcarbonate
Sample Output
carbohydrate carbohcart cartcarburetor carbucaramel caracaribou caricarbonic carbonicartilage carticarbon carboncarriage carrcarton cartocar carcarbonate carbona
Source
Rocky Mountain 2004
#include<iostream>#include<cmath>#include<cstring>#include<cstdlib>#include<cstdio>#include<algorithm>#define F(i,j,n) for(int i=j;i<=n;i++)#define D(i,j,n) for(int i=j;i>=n;i--)#define ll long long#define pa pair<int,int>#define maxn 20005#define inf 1000000000using namespace std;struct trie_type{int cnt,next[30];}t[maxn];int tot=0,n=0;char s[1005][25];inline void insert(char *ch){int p=0,l=strlen(ch);F(i,0,l-1){int tmp=ch[i]-'a';if (!t[p].next[tmp]) t[p].next[tmp]=++tot;p=t[p].next[tmp];t[p].cnt++;}}inline void find(char *ch){int p=0,l=strlen(ch);printf("%s ",ch);F(i,0,l-1){printf("%c",ch[i]);int tmp=ch[i]-'a';p=t[p].next[tmp];if (t[p].cnt==1) break;}printf("\n");}int main(){while (~scanf("%s",s[++n])) insert(s[n]);F(i,1,n-1) find(s[i]);}
0 0
- POJ2001 Shortest Prefixes
- poj2001 Shortest Prefixes
- 【poj2001】Shortest Prefixes
- POJ2001--Shortest Prefixes
- poj2001 Shortest Prefixes
- poj2001 Shortest Prefixes
- POJ2001 Shortest Prefixes
- poj2001 Shortest Prefixes
- 【POJ2001】Shortest Prefixes
- POJ2001[Shortest Prefixes]--Trie
- POJ2001-Shortest Prefixes
- POJ2001 - Shortest Prefixes - 字典树
- POJ2001——Shortest Prefixes
- POJ2001 Shortest Prefixes【字典树】
- 【poj2001】Shortest Prefixes 字典树
- POJ2001 Shortest Prefixes(字典树)
- poj2001 Shortest Prefixes (trie树)
- poj2001 Shortest Prefixes trie树
- Connect to LocalDB in Visual Studio Server Explorer
- VS 2010调用Matalab R2010b生成的DLL库的配置问题
- div中ul内容逐条上下滚动
- jinja2 字符串替换
- jquery.validate.js使用之自定义表单验证规则
- poj2001 Shortest Prefixes
- HDU-1394 Minimum Inversion Number(线段树求逆序数)
- 发现自己的编程能力在退化
- Ubuntu14.04下编译Android4.4
- swift第一课
- 从对象的内存角度来理解“父类的引用指向子类的对象”
- 关于模板template
- javaMail学习二 电子邮件的工作原理
- 锤子代工厂倒闭 老罗的“相声”还好笑吗