POJ - 2001Shortest Prefixes字典树记录

POJ - 2001 Shortest Prefixes Time Limit: 1000MS   Memory Limit: 30000KB   64bit IO Format: %I64d & %I64u Submit Status 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 /* Author: 2486 Memory: 708 KB Time: 47 MS Language: G++ Result: Accepted */ #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <queue> #include <algorithm> using namespace std; const int MAXN = 1000 + 5; char str[MAXN][25]; struct node { int v, s, next[30]; void init() { v = -1; s = 0;//记录此字符出现了多少次 memset(next, -1, sizeof(next)); } } L[1000000]; int tot, cnt; void add(char a[], int len) { int now = 0; for(int i = 0; i < len; i ++) { int tmp = a[i] - 'a'; int next = L[now].next[tmp]; if(next == -1) { next = ++ tot; L[next].init(); L[now].next[tmp] = next; } now = next; L[now].s ++; } L[now].v = 0; } void query(char a[], int len) { int now = 0, p = 0; for(int i = 0; i < len; i ++) { int tmp = a[i] - 'a'; int next = L[now].next[tmp]; if(L[now].s > 1) { p = i + 1; } now = next; } for(int i = 0; i < p && i < len; i ++) { printf("%c", a[i]); } printf("\n"); } int main() { //freopen("D://imput.txt", "r", stdin); tot = cnt = 0; L[0].init(); while(~ scanf("%s", str[cnt ++])) { add(str[cnt - 1], strlen(str[cnt - 1])); } for(int i = 0; i < cnt; i ++) { printf("%s ", str[i]); query(str[i], strlen(str[i])); } return 0; }