POJ_2001_Shortest_Prefixes_(Trie)

描述


http://poj.org/problem?id=2001

给出一组单词,求每个单词的最小唯一前缀.

最小唯一前缀:该前缀不能是其他单词的前缀,并且最小,如果不存在,则为该单词本身.

 

 

Shortest Prefixes

 

Time Limit: 1000MS   Memory Limit: 30000K
Total Submissions: 16921   Accepted: 7338

 

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

 

Source

 

 

 

分析


唯一前缀就要求前缀的末位置只出现过一次,所以在Trie中insert的时候顺便记下每个点经过的次数.查找时一直找到第一个只出现了一次的点,或者查完整个单词.

p.s.打打Trie模板,已经忘干净了.

复制代码
 1 #include <cstdio>
 2 #include <cstring>
 3 using namespace std;
 4 
 5 const int type=26;
 6 
 7 struct Trie{
 8     struct node{
 9        node* next[type];
10        int num;
11        node(){
12           num=0;
13           for(int i=0;i<type;i++) next[i]=NULL;
14        }
15     }*root;
16     Trie(){ root=new node; }
17     inline int id(char c) { return c-'a'; }
18     void insert(char *c){
19        node* o=root;
20        while(*c){
21           int t=id(*c);
22           if(o->next[t]==NULL) o->next[t]=new node;
23           o=o->next[t];
24           o->num++;
25           c++;
26        }
27     }
28     void search(char *c){
29        node* o=root;
30        while(*c){
31           int t=id(*c);
32           o=o->next[t];
33           printf("%c",*c);
34           if(o->num==1) return;
35              c++;
36        }
37     }
38 }tree;
39 char c[1005][25];
40 
41 int main(){
42     int cnt=0;
43     while(scanf("%s",c[++cnt])!=EOF) tree.insert(c[cnt]);
44     for(int i=1;i<=cnt;i++){
45        printf("%s ",c[i]);
46        tree.search(c[i]);
47        printf("\n");
48     }
49     return 0;
50 }
View Code
复制代码

 

posted @   晴歌。  阅读(206)  评论(0编辑  收藏  举报
编辑推荐:
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
· .NET 9 new features-C#13新的锁类型和语义
阅读排行:
· 手把手教你在本地部署DeepSeek R1,搭建web-ui ,建议收藏!
· Spring AI + Ollama 实现 deepseek-r1 的API服务和调用
· 《HelloGitHub》第 106 期
· 数据库服务器 SQL Server 版本升级公告
· C#/.NET/.NET Core技术前沿周刊 | 第 23 期(2025年1.20-1.26)
点击右上角即可分享
微信分享提示