poj 2001 Shortest Prefixes Trie树
来源:互联网 发布:黑客网络分析软件 编辑:程序博客网 时间:2024/04/28 12:22
Shortest Prefixes
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11327 Accepted: 4809
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<cstring>#include<cstdio>#include<cmath>#include <algorithm>using namespace std;const int MAXN=500;const int MAXM=100005;typedef struct Trie{ int id; int v; //前缀记录标志 Trie *p[26]; Trie() { v=0; int i; id=-1; for(i=0; i<26; i++)p[i]=NULL; }}Trie;Trie *root;int cnt;void createTrie(char *s){ int i; Trie *r=root; int l=strlen(s); for(i=0; i<l; i++) { r->v++; if(r->p[s[i]-'a']==NULL) { r->p[s[i]-'a']=new Trie(); } r=r->p[s[i]-'a']; } if(r->id==-1) { r->id=cnt; r->v++; cnt++; }// return r->id;}void findTrie(char *s){ int i; Trie *r=root; int l=strlen(s); for(i=0; i<l; i++) { r=r->p[s[i]-'a']; if(r->v==1) { for(int j=0; j<=i; j++) { cout<<s[j]; } cout<<endl; return; } } cout<<s<<endl;}char str[MAXM][MAXN];int main(){ int n,i,t=0; while(scanf("%s",str[0])!=EOF) { t=1; //字符串总数 cnt=1; root=new Trie(); createTrie(str[0]); while(scanf("%s",str[t])!=EOF) { createTrie(str[t]); t++; } for(i=0; i<t; i++) { cout<<str[i]<<" "; findTrie(str[i]); } } return 0;}
- poj 2001 Shortest Prefixes Trie树
- poj 2001 Shortest Prefixes(Trie树)
- poj 2001 Shortest Prefixes Trie树
- POJ 2001 Shortest Prefixes 字典树Trie
- POJ 2001 Shortest Prefixes(字典树Trie)
- poj 2001 Shortest Prefixes(trie树)
- POJ 2001 - Shortest Prefixes (Trie树)
- poj 2001 Shortest Prefixes(trie树)
- poj -- 2001 Shortest Prefixes (Trie 树)
- POJ-2001 Shortest Prefixes(Trie树)
- poj 2001 Shortest Prefixes (Trie树)
- POJ 2001 Shortest Prefixes(字典树Trie)
- poj 2001 Shortest Prefixes(Trie)
- poj 2001 Shortest Prefixes trie
- poj 2001 Shortest Prefixes Trie
- POJ 2001 Shortest Prefixes // Trie
- [poj 2001]Shortest Prefixes [Trie]
- POJ 2001 Shortest Prefixes 【 trie树(别名字典树)】
- web容器
- 进程、过程调用、函数调用、堆、栈
- linux 文件I/O
- hdu1016(素数环)
- eclipse与AVD模拟器断开问题
- poj 2001 Shortest Prefixes Trie树
- 让XCode Crash的 Stack Trace信息可读
- C语言中&&,||,&,| 的区别
- 使用Crashlytics来保存IOS应用崩溃信息
- 黑马程序员—网络编程
- hdu 2732&&poj 2711 (最大流)
- 编译Android4.3内核源代码
- 设计模式——简单工厂模式—工厂方法模式—抽象工厂模式(比较)
- hdu 4422(水)