poj2011
2024-08-31 00:04:45
Shortest Prefixes
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 17608 | Accepted: 7658 |
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[now].w表示now这个节点被用过几次,当我们扫一个单词时,
如果它的某一个字母只用过一次,即只有它用过,那么这以前就是它的前缀。
AC代码:
#include<cstdio>
#include<cstring>
using namespace std;
const int N=;
const int M=;
struct node{
int next[M];
int w;
}tire[N*M];
char s[N][M];
int cnt,n;
void build(int num){
int now=,len=strlen(s[num]);
for(int i=;i<len;i++){
int x=s[num][i]-'a'+;
if(!tire[now].next[x])
tire[now].next[x]=++cnt;
now=tire[now].next[x];
tire[now].w++;
}
}
void query(int num){
int now=,len=strlen(s[num]);
for(int i=;i<len;i++){
int x=s[num][i]-'a'+;
now=tire[now].next[x];
printf("%c",s[num][i]);
if(tire[now].w==) break;
}
}
int main(){
while(scanf("%s",s[++n])==) build(n);n--;
for(int i=;i<=n;i++) printf("%s ",s[i]),query(i),putchar('\n');
return ;
}
最新文章
- Html5 布局方式
- bootstrapValidator.js,最好用的bootstrap表单验证插件
- 您还有心跳吗?超时机制分析(java)
- Version history of VC++, MFC and ATL
- 利用Canvas编辑图片
- Zigzag convert
- AxureRP7.0各类交互效果汇总帖(转)
- sonar-gerrit-plugin-2.2.0 安装
- 定时器 corn 表达式
- 使用 Protocol Buffers 代替 JSON 的五个原因
- 如何让你的 Asp.Net Web Api 接口,拥抱支持跨域访问。
- ActiveMQ学习笔记(二) JMS与Spring
- C++设计模式---职责链模式
- bootstrap实现checkbox全选、取消全选
- (转) mysql中left join,right join,inner join的区别
- Win8.1开机自启动程序
- java内存分配策略
- 手动启动 oracle 服务
- (数据科学学习手札53)Python中tqdm模块的用法
- 模拟admin组件自己开发stark组件之自定义list_display,反向解析url
热门文章
- 新开的坑-python学习笔记(1)——连接符与转义
- HDU_2112_最短路
- lsb_release No LSB modules are available
- JavaScipt30(第四个案例)(主要知识点:数组原型链上的一些方法)
- CSS 类名的问题
- php总结回顾
- 关于fragment+viewpager的优化
- Python使用Flask框架,结合Highchart处理xml数据
- Python条件控制语句
- Python学习:ModuleNotFoundError: No module named &#39;pygal.i18n&#39; 的解决方法