【POJ2001】Shortest Prefixes
2024-08-31 05:37:22
Shortest Prefixes
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 18724 | Accepted: 8101 |
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
字典树裸题,如果不会请参考其他算法书。
代码:
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<cstring>
using namespace std;
int a[][];
int quan[];
char chuan[][];
int num1=,num2=;
void insert(char x[]){
int len=strlen(x);
int now=;
for(int i=;i<len;i++){
int to=x[i]-'a';
if(!a[now][to]){
memset(a[++num2],,sizeof(a[num2]));
a[now][to]=num2;
}
now=a[now][to];
quan[now]++;
}
}
void dfs(char x[]){
int len=strlen(x);
int now=;
for(int i=;i<len;i++){
int to=x[i]-'a';
if(!a[now][to]){printf("");return;}
now=a[now][to];
printf("%c",x[i]);
if(quan[now]==) return;
}
}
int main(){
//freopen("1.in","r",stdin);
//freopen("1.out","w",stdout);
memset(quan,,sizeof(quan));
memset(chuan[],,sizeof(chuan[]));
while(scanf("%s",&chuan[num1])!=EOF){
insert(chuan[num1]);
num1++;
}
for(int i=;i<num1;i++){
printf("%s ",chuan[i]);
dfs(chuan[i]);
printf("\n");
}
}
最新文章
- 10个漂亮的响应式的食品 WordPress 美食模板
- yum简单安装salt master与minion
- 汇总10.4版本ArcGIS Server与ArcMap 安装+SDE+注册数据源(非破解)
- 64位CentOS 6.4下安装wine
- Google Map JavaScript API V3 实例大全
- 使用AutoMapper
- 涂抹Oracle笔记1-创建数据库及配置监听程序
- 高性能javascript 学习笔记(1)
- 设置textarea文本域不能调整大小 resize
- Java爬虫(一)利用GET和POST发送请求,获取服务器返回信息
- Git: 本地创建版本库用于多处同步
- 利用百度地图api实现定位
- python笔记01-05
- c# 虚函数 ,抽象类
- ASP.NET网站不能在VS中调试
- JMETER java.net.SocketException: Connection reset 报错解决方案
- OO课程第三次总结QWQ
- noip2013火柴排队_Solution
- 类的静态(Static)成员——字段
- PDCA管理方法论