http://poj.org/problem?id=2001
Shortest Prefixes
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 11343 Accepted: 4816
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
解析:
题意:
任意输入多个字符串,输出每个字符串的最短前缀使其能够被唯一标记
思路:
裸的的trie树,建树的时候注意节点的保存
查询的时候只要判断一下节点即可
Accepted 2408K 32MS C++ 1016B
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <iostream>
using namespace std;
const int maxn=20000+10;
int cnt,tr[maxn][27];
int node[maxn];
char s[10002][22];
void init()//初始化节点
{
cnt=1;
memset(tr[0],0,sizeof(tr));
memset(node,0,sizeof(node));
}
void insert(char s[])//构造tire树
{
int u=0;
int len=strlen(s),c;
for(int i=0;i<len;i++)
{ c=s[i]-'a';
if(tr[u][c]==0)
{
memset(tr[cnt],0,sizeof(tr[cnt]));
tr[u][c]=cnt++;
}
u=tr[u][c];//计入下一结点
node[u]++;//标记一下该节点
}
}
void search(char s[])
{
int u=0;
int len=strlen(s);
for(int i=0;i<len;i++)
{ int c=s[i]-'a';
printf("%c",s[i]);
u=tr[u][c];
if(node[u]==1)//一旦该节点的出现次数为1则代表已经已经是把最短前缀输出了
return;
}
}
int main()
{
int c=0,i;
init();
while(gets(s[c]))
{ if(s[c][0]=='\0')
break;
// printf("%s\n",s[c]);
insert(s[c]);
c++;
}
for(i=0;i<c;i++)
{
printf("%s ",s[i]);
search(s[i]);
printf("\n");
}
//system("pause");
return 0;
}