Immediate Decodability(字典树)

Immediate Decodability

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

点我

[align=left]Problem Description[/align]
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)

[align=left]Input[/align]
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).

[align=left]Output[/align]
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.

[align=left]Sample Input[/align]

01
10
0010

0000
9
01
10
010

0000
9

[align=left]Sample Output[/align]

Set 1 is immediately decodable
Set 2 is not immediately decodable
题目大意：判断是否存在一串编码是另一串编码的前缀

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define max 2
typedef struct TrieNode
{
int ncount;
struct TrieNode *next[max];
}TrieNode;
TrieNode* createTrieNode()
{
TrieNode* temp=new TrieNode;
temp->ncount=0;
for(int i=0;i<max;i++)
temp->next[i]=NULL;
return temp;
}
void insertTrie(TrieNode* proot,char* str)
{
TrieNode *temp=proot;
for(int i=0;str[i];i++)
{
int t=str[i]-'0';
if(temp->next[t]==NULL)
temp->next[t]=createTrieNode();
temp=temp->next[t];
temp->ncount++;
}
}
int searchTrie(TrieNode* p,char *str)
{
for(int i=0;str[i];i++)
{
int t=str[i]-'0';
p=p->next[t];
if(!p)
return 0;
}
return p->ncount;
}
int main()
{
char a[99][100];
int i=0,k=1;
TrieNode* root=createTrieNode();
while(gets(a[i]))
{
int count=0;
while(a[i][0]!='9')
{
insertTrie(root,a[i]);
i++;
gets(a[i]);
}
count=i;
for(i=0;i<count;i++)
{
if(searchTrie(root,a[i])!=1)
{
cout<<"Set "<<k++<<" is not immediately decodable"<<endl;
break;
}
}
if(i==count)
cout<<"Set "<<k++<<" is immediately decodable"<<endl;
i=0;
}
}