关闭

HDOJ 1305 Immediate Decodability (字典树判断是否存在子串)

270人阅读 评论(0) 收藏 举报
分类:

Immediate Decodability

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2361    Accepted Submission(s): 1220


Problem Description
An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, that no two codes within a set of codes are the same, that each code has at least one bit and no more than ten bits, and that each set has at least two codes and no more than eight.

Examples: Assume an alphabet that has symbols {A, B, C, D}

The following code is immediately decodable:
A:01 B:10 C:0010 D:0000

but this one is not:
A:01 B:10 C:010 D:0000 (Note that A is a prefix of C)
 

Input
Write a program that accepts as input a series of groups of records from input. Each record in a group contains a collection of zeroes and ones representing a binary code for a different symbol. Each group is followed by a single separator record containing a single 9; the separator records are not part of the group. Each group is independent of other groups; the codes in one group are not related to codes in any other group (that is, each group is to be processed independently).
 

Output
For each group, your program should determine whether the codes in that group are immediately decodable, and should print a single output line giving the group number and stating whether the group is, or is not, immediately decodable.
 

Sample Input
01 10 0010 0000 9 01 10 010 0000 9
 

Sample Output
Set 1 is immediately decodable Set 2 is not immediately decodable
 


ac代码:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stack>
#include<iostream>
#include<algorithm>
#define fab(a) (a)>0?(a):(-a)
#define LL long long
#define MAXN 10010
#define mem(x) memset(x,0,sizeof(x))
#define INF 0xfffffff 
using namespace std;
struct s
{
	int num;
	s *next[10];
};
struct word
{
	char phone[12];
	int len;
}a[MAXN];
s *root;
bool cmp(word q,word w)
{
	return q.len<w.len;
}
void create(char *str)
{
	int len=strlen(str);
	s *p=root,*q;
	for(int i=0;i<len;i++)
	{
		int id=str[i]-'0';
		if(p->next[id]==NULL)
		{
			q=(s *)malloc(sizeof(s));
			q->num=1;
			for(int j=0;j<10;j++)
			q->next[j]=NULL;
			p->next[id]=q;
			p=p->next[id];
		}
		else
		{
			p->next[id]->num++;
			p=p->next[id];
		}
	}
	//p->num=-1;
}
int find(char *ss)
{
	int len=strlen(ss);
	s *p=root;
	for(int i=0;i<len;i++)
	{
		int id=ss[i]-'0';
		p=p->next[id];
		if(p==NULL)
		return 0;
//		if(p->num==-1)
//		return -1;
	}
	return p->num;
}
void begin()
{
	for(int i=0;i<10;i++)
	root->next[i]=NULL;
}
void freetree(s *t)
{
	if(t==NULL)
	return;
	for(int i=0;i<10;i++)
	{
		if(t->next[i]!=NULL)
		freetree(t->next[i]);
	}
	free(t);
	return;
}
int main()
{
	
	int i,n;
	int cnt=0;
	while(scanf("%s",a[0].phone)!=EOF)
	{
		int k=1;
	    while(scanf("%s",a[k].phone)!=EOF,a[k].phone[0]!='9')
	    {
		    int l=strlen(a[k].phone);
			a[k].len=l;
			k++;
		}
	//	printf("%s\n",a[k-1].phone);
		int bz=0;
		root=(s *)malloc(sizeof(s));
		begin();
		sort(a,a+k,cmp);
		create(a[k-1].phone);
		for(i=k-2;i>=0;i--)
		{
			if(find(a[i].phone)==0)
			create(a[i].phone);
			else
			{
				bz=1;;
				break;
			}
		}
		printf(bz?"Set %d is not immediately decodable\n":"Set %d is immediately decodable\n",++cnt);
		freetree(root);
	}
	return 0;
}


0
0
查看评论

Immediate Decodability (HDU_1305) 字典树

Immediate Decodability Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): ...
  • Keeping111
  • Keeping111
  • 2016-03-08 23:26
  • 433

hdoj Immediate Decodability 1305 (字典树判断前缀)

Immediate Decodability Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2397&...
  • yanghui07216
  • yanghui07216
  • 2015-11-26 20:51
  • 204

1305 Immediate Decodability(字典树)

Immediate Decodability(链接) Sample Input 01 10 0010 0000 9 01 10 010 0000 9   Sample Output Set 1 is immediately decodable Se...
  • qq_38199856
  • qq_38199856
  • 2017-11-21 21:39
  • 42

Immediate Decodability(字典树-判断是否存在前缀)

Immediate Decodability Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): ...
  • baidu_23955875
  • baidu_23955875
  • 2015-08-30 09:01
  • 268

hdu 1305 Immediate Decodability 字典树

字典树统计字符串个数 题意:给你一些字母的编码,全部为01串,让你判断一个01串是不是另外一个01串的前缀。 思路:把01全部存入字典树里面,在依次查找这些字符串,如果这个字符串出现的次数大于等于两次,就不可以快速解码了 详情见代码: #include #include #include #def...
  • HLSHYR
  • HLSHYR
  • 2016-07-07 09:03
  • 157

hdu 1305 Immediate Decodability (字典树)

判断给出的二进制编码是否是哈弗曼编码 #include #include #include #include #include #include #include using namespace std; typedef long long lld; const int oo=0x3f3f3f...
  • My_ACM_Dream
  • My_ACM_Dream
  • 2015-02-06 12:26
  • 279

Hdu 1305 Immediate Decodability 字典树

题意:在多个字符串里寻找,若他们至少有一个串是另一个串的前缀,则按题目要求输出语气 思路:建立字典树,因为只有0 1两数,数组开2大就行,判断是前缀的方法:每次插入一个字符串,在字典树中查询,若当到达已经存在了的字符串,即cur->cnt==1 ,也就是插入字符串的前缀,或者在字典树中能够找...
  • acm18810549519
  • acm18810549519
  • 2013-09-06 11:21
  • 557

HDU - 1305 Immediate Decodability 字典树

字典树:问是否在给出的二进制中能找到前缀码。 #include #include #include #include #include using namespace std; struct node{ int x; node *next[22]; node() { x=0; fo...
  • liu397688551
  • liu397688551
  • 2017-08-16 14:08
  • 47

HDU 1305 Immediate Decodability (字典树)

Immediate Decodability题目链接Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 3 Accepted Submiss...
  • lihao161530340
  • lihao161530340
  • 2017-08-03 20:39
  • 94

hdu 1305 Immediate Decodability(字典树)

数据结构,字典树,二叉树
  • u010103075
  • u010103075
  • 2013-08-04 15:56
  • 843
    时刻记住--never give up
    人生如棋,吾愿为卒,吾行虽慢,谁曾见吾后退半步!
    个人资料
    • 访问:210582次
    • 积分:9027
    • 等级:
    • 排名:第2483名
    • 原创:723篇
    • 转载:3篇
    • 译文:0篇
    • 评论:29条