POJ 1056 IMMEDIATE DECODABILITY(字典树,判断有没有一个是另一个的前缀)
2012-08-06 12:41
435 查看
IMMEDIATE DECODABILITY
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 standard 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
Sample Output
Source
Pacific Northwest 1998
字典树基本的练习题。
判断立即码。
就是找有没有一个是另一个的前缀哦
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 8895 | Accepted: 4222 |
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 standard 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
Source
Pacific Northwest 1998
字典树基本的练习题。
判断立即码。
就是找有没有一个是另一个的前缀哦
//POJ 1056 IMMEDIATE DECODABILITY //就是看有没有字符串是另一个的前缀 //立即码(也叫异前置码) #include<stdio.h> #include<stdlib.h> #include<iostream> #include<algorithm> #include<string.h> using namespace std; const int MAX=2; typedef struct Trie_Node { bool isCode; struct Trie_Node *next[MAX]; }Trie; bool flag; void insert(Trie *root,char *str) { Trie *p=root; int i=0; while(str[i]!='\0') { if(p->next[str[i]-'0']==NULL) { Trie *temp=new Trie; for(int j=0;j<MAX;j++) temp->next[j]=NULL; temp->isCode=false; p->next[str[i]-'0']=temp; } else { if(p->next[str[i]-'0']->isCode) { flag=false; return; } } p=p->next[str[i]-'0']; i++; } p->isCode=true; } void del(Trie *root) { for(int i=0;i<MAX;i++) if(root->next[i]!=NULL) del(root->next[i]); free(root); } int main() { // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); char str[20]; int iCase=0; while(scanf("%s",&str)!=EOF) { iCase++; Trie *root=new Trie; for(int i=0;i<MAX;i++) root->next[i]=NULL; root->isCode=false; flag=true; insert(root,str); while(scanf("%s",&str)) { if(strcmp(str,"9")==0)break; if(flag) insert(root,str); } if(flag)printf("Set %d is immediately decodable\n",iCase); else printf("Set %d is not immediately decodable\n",iCase); del(root); } return 0; }
相关文章推荐
- poj 3630 Phone List 【字典树】【判断一个字符串集里面 是否存在一个字符串是另一个字符串前缀】
- HDOJ-1671 Phone List 字典树的应用----判断一组字符串中是否有一个字符串是另一个字符串的前缀(字典树第二类应用)。
- (Relax ST1.4)POJ 1056 IMMEDIATE DECODABILITY(判断一个字符串是否是另外一个字符串的前缀)
- 输入两个整数序列。其中一个序列表示栈的push顺序, 判断另一个序列有没有可能是对应的pop顺序。 为了简单起见,我们假设push序列的任意两个整数都是不相等的
- (Relax ST1.9)POJ 1936 All in All(判断一个字符串去掉一部分以后是否等价于另一个字符串)
- 给一个有N个整数的数组S..和另一个整数X,判断S里有没有2个数的和为X,请设计成O(n*log2(n))的算法
- 输入两个整数序列。其中一个序列表示栈的push顺序, 判断另一个序列有没有可能是对应的pop顺序。 为了简单起见,我们假设push序列的任意两个整数都是不相等的
- 两个整数序列,其中一个序列表示栈的push顺序, 判断另一个序列有没有可能是对应的pop顺序。
- poj 1056 判断前缀
- 162 1. 给一个有N个整数的数组S..和另一个整数X,判断S里有没有2个数的和为X
- POJ 3630-Phone List【比较许多字符中有没有一个是另一个的前缀,简单方法】
- POJ---2001 Shortest Prefixes[字典树---判断唯一前缀]
- POJ 1380 Equipment Box(判断一个长方形能不能包含另一个长方形)
- PHP 输入两个整数序列。其中一个序列表示栈的push 顺序, 判断另一个序列有没有可能是对应的pop 顺序
- poj 2001/1056 Trie树(求单词表的最短前缀/判断立即码)
- 1. 给一个有N个整数的数组S..和另一个整数X,判断S里有没有2个数的和为X,请设计成O(n*log2(n))的算法。
- 题目:输入两个整数序列。其中一个序列表示栈的push顺序,判断另一个序列有没有可能是对应的pop顺序。
- 【练习】输入两个整数序列。其中一个序列表示栈的push 顺序,判断另一个序列有没有可能是对应的pop 顺序
- POJ 1056 immediately decodable (判断是否有前缀)
- 【算法】输入两个整数序列。其中一个序列表示栈的push顺序,判断另一个序列有没有可能是对应的pop顺序。