Shortest Prefixes
Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 21761 Accepted: 9320 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 carbonateSample Output
carbohydrate carboh cart cart carburetor carbu caramel cara caribou cari carbonic carboni cartilage carti carbon carbon carriage carr carton carto car car carbonate carbonaSource
就是对于每个字符串,找一个前缀,能唯一代表他。如果找不到就输出本身
坑得一逼,如果char[]开在函数里面,要初始化,之前一直没做过里面开char的题目,wa一万年
//#include<bits/stdc++.h>
#include<stdio.h>
#include<iostream>
#include<string.h>
#define ll long long
#define dprintf if (debug) printf
#define rep(i, j, k) for (int i=j; i<k; i++)
using namespace std;
const int maxn = 2e6;
const int debug = 0;
char s[1005][30];
int tot, cnt;
int T[maxn][30], sum[maxn];
void insert(char *s){
int len = strlen(s);
int rt = 0;
rep(i, 0, len){
int id = s[i] - 'a';
if (!T[rt][id]){
T[rt][id] = ++tot;
}
rt = T[rt][id];
sum[rt]++;
}
}
int find_unique(char* s){
printf("%s ", s);
int len = strlen(s);
int rt = 0;
char ans[30]={""};//坑得一逼
rep(i, 0, len){
int id = s[i] - 'a';
ans[i] = s[i];
if (!T[rt][id]) {
dprintf("not found\n");
return 0;
}
if (sum[T[rt][id]] == 1){
printf("%s\n", ans);
return 1;
}
rt = T[rt][id];
}
printf("%s\n", s);
//dprintf("not found 2\n");
return 0;
}
int main(){
while (~scanf("%s", s[cnt])){
insert(s[cnt]);
cnt++;
}
dprintf("\n\n\n");
rep(i, 0, cnt){
find_unique(s[i]);
}
}