UVa 644 Immediate Decodability (前缀匹配)

最新推荐文章于 2026-06-16 20:19:21 发布

原创最新推荐文章于 2026-06-16 20:19:21 发布 · 1.1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#acm #c++ #UVa

UVa 同时被 3 个专栏收录

407 篇文章

订阅专栏

acm之路--数据结构

111 篇文章

订阅专栏

acm之路--字符串

42 篇文章

订阅专栏

本文介绍了一种算法，用于判断一组二进制编码的符号集是否立即可解码，即任一符号的编码都不是其他符号编码的前缀。通过示例说明了立即可解码的概念，并提供了一个具体的实现方案。

644 - Immediate Decodability

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=585

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 a data file. 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.

The Sample Input describes the examples above.

Sample Input

Sample Output

Set 1 is immediately decodable
Set 2 is not immediately decodable

完整代码：

/*0.035s*/

#include<cstdio>
#include<cstring>

char s[1000][100];
int n;

inline bool check()
{
	for (int i = 0; i < n - 1; i++)
		for (int j = i + 1; j < n; j++)
		{
			bool flag = false;
			int l1 = strlen(s[i]);
			int l2 = strlen(s[j]);
			for (int k = 0; k < l1 && k < l2; k++)///比strstr()要快一点
				if (s[i][k] != s[j][k])
				{
					flag = true;
					break;
				}
			if (!flag) return false;
		}
	return true;
}

int main(void)
{
	int cas = 0;
	while (gets(s[0]))
	{
		for (n = 1;; n++)
		{
			gets(s[n]);
			if (s[n][0] == '9')
				break;
		}
		if (check()) printf("Set %d is immediately decodable\n", ++cas);
		else printf("Set %d is not immediately decodable\n", ++cas);
	}
}