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.
题意就是说,给多个单词,在单词间缩写互不干扰表示的情况下找到每个单词最短的缩写。
互不干扰当然就是某单词的缩写肯定无法表示另一个单词,那就先构建trie树,再枚举每个单词,找到该单词所及的第一个访问次数为1的节点即可
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
const int MAXN=3000000;
typedef long long ll;
char s[10005][31];
struct node
{
int num;
node* next[26];
node()
{
memset(next,NULL,sizeof(next));
num=0;
}
};
node* root=new node();
void build(char str[])
{
node* p=root;
int len=strlen(str);
for(int i=0;i<len;i++)
{
int index=str[i]-'a';
if(p->next[index]==NULL)
{
p->next[index]=new node();
}
p=p->next[index];
p->num++;
}
}
void query(char str[])
{
node* p=root;
int len=strlen(str);
for(int i=0;i<len;i++)
{
printf("%c",str[i]);
int index=str[i]-'a';
p=p->next[index];
if(p->num==1)
return;
}
}
int main()
{
int T;
int n=0;
while(scanf("%s",s[n])!=EOF)
{
build(s[n]);
n++;
}
for(int i=0;i<n;i++)
{
printf("%s ",s[i]);
query(s[i]);
printf("\n");
}
return 0;
}