poj 1056 IMMEDIATE DECODABILITY 字典树
来源:互联网 发布:怎么在淘宝里买电棍 编辑:程序博客网 时间:2024/05/22 11:39
IMMEDIATE DECODABILITY
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11709 Accepted: 5570
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)
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
0110001000009011001000009
Sample Output
Set 1 is immediately decodableSet 2 is not immediately decodable
Source
Pacific Northwest 1998
代码:
代码:
#include <stdio.h>#include <string.h>#include <stdlib.h>typedef struct ac{ int v; struct ac *child[3];}tree;tree *root;int flag;void add(char *s){ int i,j,l=strlen(s); tree *a=root,*b; for(i=0;i<l;i++) { int k=s[i]-'0'; if(a->child[k]!=NULL) { a=a->child[k]; if(a->v==1) { flag=1; break; } } else { b=(tree*)malloc(sizeof(tree)); a->child[k]=b; for(j=0;j<2;j++) b->child[j]=NULL; a=b; } } a->v=1; for(int i=0;i<2;i++) { if(a->child[i]!=0) { flag=1; return ; } }}void clear2(tree* a){ if(a==NULL) return ; else { for(int i=0;i<2;i++) clear2(a->child[i]); } free(a);}char s[10005];int main(){ int n; root=(tree*)malloc(sizeof(tree)); memset(s,'\0',sizeof(s)); for(int j=0;j<2;j++) root->child[j]=NULL; root->v=0; int i=1; while(scanf("%s",s)!=EOF) { //getchar(); if(s[0]=='9') { if(!flag) printf("Set %d is immediately decodable\n",i++); else printf("Set %d is not immediately decodable\n",i++); clear2(root); flag=0; root=(tree*)malloc(sizeof(tree)); memset(s,'\0',sizeof(s)); for(int j=0;j<2;j++) root->child[j]=NULL; root->v=0; continue; } add(s); } return 0;}
0 0
- POJ 1056 IMMEDIATE DECODABILITY (字典树)
- POJ 1056 IMMEDIATE DECODABILITY 字典树
- poj 1056 IMMEDIATE DECODABILITY 字典树
- POJ 1056 IMMEDIATE DECODABILITY(字典树)
- poj 1056 IMMEDIATE DECODABILITY 字典树
- POJ 1056 IMMEDIATE DECODABILITY 字典树
- POJ 1056 IMMEDIATE DECODABILITY(字典树 水题)
- poj 1056 IMMEDIATE DECODABILITY(字典树)
- POJ 题目1056 IMMEDIATE DECODABILITY(字典树)
- Immediate Decodability 字典树
- IMMEDIATE DECODABILITY(字典树)
- Immediate Decodability-字典树
- poj 1056 : immediate decodability
- POJ 1056 IMMEDIATE DECODABILITY
- POJ 1056 IMMEDIATE DECODABILITY
- <poj 1056>IMMEDIATE DECODABILITY
- poj 1056 IMMEDIATE DECODABILITY
- poj 1056 IMMEDIATE DECODABILITY
- Gridview绑定数据库的字段,根据条件字段颜色改变
- 芯片IC附近为什么都放0.1uF的电容?这样做正确吗?有什么依据吗?
- Android基础知识
- 使用栈判断括号匹配
- HDU1159 && POJ1458 Common Subsequence (LCS模版题)
- poj 1056 IMMEDIATE DECODABILITY 字典树
- poj 2001 Shortest Prefixes(字典树 )
- 9:Palindrome Number【数学】
- LINK : fatal error LNK1123: 转换到 COFF 期间失败: 文件无效或损坏
- Linux C 程序崩溃是如何采取挽救措施
- 解决eclipse连接不到genymotion的问题
- HDU2093 考试排名 【水题】
- JavaScript特效动画实例—图片轮播 右下角图片广告 原生js日历
- KMP算法详解