zoukankan      html  css  js  c++  java
  • poj--2001--Shortest Prefixes(字典树)

    Time Limit: 1000MS   Memory Limit: 30000KB   64bit IO Format: %I64d & %I64u

    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
    

    Source

    Rocky Mountain 2004



    #include<stdio.h>
    #include<string.h>
    int ch[10000+30][30];
    char str[1010][1000];
    int sz;
    int word[10010];
    void init()
    {
    	sz=1;
    	memset(ch[0],0,sizeof(ch[0]));
    	memset(word,0,sizeof(word));
    }
    void insert(char *s)
    {
    	int l=strlen(s);
    	int u=0;
    	for(int i=0;i<l;i++)
    	{
    		int c=s[i]-'a';
    		if(!ch[u][c])
    		{
    			memset(ch[sz],0,sizeof(ch[sz]));//清空当前层 
    			ch[u][c]=sz;//记录下一层的层数 
    			sz++;
    		}
    		u=ch[u][c];
    		word[u]++;//当前节点下的单词数加一 
    	}
    }
    void find(char *s)
    {
    	int l=strlen(s);
    	int u=0;
    	for(int i=0;i<l;i++)
    	{
    		int c=s[i]-'a';
    		u=ch[u][c];//从第一层开始找,每次用u取下一层的层数 
    		printf("%c",s[i]);
    		if(word[u]==1)//word[u]==1表示当前节点只有一个单词 
    		return ;
    	}
    }
    int main()
    {
    	int n=0;
    	init();
    	while(scanf("%s",str[n])!=EOF)
    	{
    		insert(str[n]);
    		n++;
    	}
    	for(int i=0;i<n;i++)
    	{
    		printf("%s ",str[i]);
    		find(str[i]);
    		printf("
    ");
    	}
    	return 0;
    }


  • 相关阅读:
    C++ tinyXml直接解析XML字符串
    留言板小程序开发笔记3
    如何去除 gvim 的 acp和 "option omnifunc is not set" 的问题
    如何修改bootstrap模态框的backdrop蒙版区域的颜色?
    Windows下卸载软件时提示 等待先前的卸载完成? 终止 dllhost.exe 进程
    thinkphp中的__DIR__ __ROOT__ __APP__ __MODULE__ APP_PATH LIB_PATH MODULE_PATH 等是在哪里定义的?
    thinkphp中的Ueditor的使用, 以及如何传递编辑器内容到后台?
    留言板小程序开发笔记2
    分页器的js实现代码 bootstrap Paginator.js
    windows的gvim总是报错: +iconv fencview.vim
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273761.html
Copyright © 2011-2022 走看看