HDOJ1053 哈夫曼编码 优先队列解决
2017-09-06 14:51
344 查看
Entropy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6634 Accepted Submission(s): 2821
Problem Description
An entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” information removed. In other words, entropy encoding removes information that was not necessary in the first place to accurately
encode the message. A high degree of entropy implies a message with a great deal of wasted information; english text encoded in ASCII is an example of a message type that has very high entropy. Already compressed messages, such as JPEG graphics or ZIP archives,
have very little entropy and do not benefit from further attempts at entropy encoding.
English text encoded in ASCII has a high degree of entropy because all characters are encoded using the same number of bits, eight. It is a known fact that the letters E, L, N, R, S and T occur at a considerably higher frequency than do most other letters in
english text. If a way could be found to encode just these letters with four bits, then the new encoding would be smaller, would contain all the original information, and would have less entropy. ASCII uses a fixed number of bits for a reason, however: it’s
easy, since one is always dealing with a fixed number of bits to represent each possible glyph or character. How would an encoding scheme that used four bits for the above letters be able to distinguish between the four-bit codes and eight-bit codes? This
seemingly difficult problem is solved using what is known as a “prefix-free variable-length” encoding.
In such an encoding, any number of bits can be used to represent any glyph, and glyphs not present in the message are simply not encoded. However, in order to be able to recover the information, no bit pattern that encodes a glyph is allowed to be the prefix
of any other encoding bit pattern. This allows the encoded bitstream to be read bit by bit, and whenever a set of bits is encountered that represents a glyph, that glyph can be decoded. If the prefix-free constraint was not enforced, then such a decoding would
be impossible.
Consider the text “AAAAABCD”. Using ASCII, encoding this would require 64 bits. If, instead, we encode “A” with the bit pattern “00”, “B” with “01”, “C” with “10”, and “D” with “11” then we can encode this text in only 16 bits; the resulting bit pattern would
be “0000000000011011”. This is
4000
still a fixed-length encoding, however; we’re using two bits per glyph instead of eight. Since the glyph “A” occurs with greater frequency, could we do better by encoding it with fewer bits? In fact we can, but in order to maintain
a prefix-free encoding, some of the other bit patterns will become longer than two bits. An optimal encoding is to encode “A” with “0”, “B” with “10”, “C” with “110”, and “D” with “111”. (This is clearly not the only optimal encoding, as it is obvious that
the encodings for B, C and D could be interchanged freely for any given encoding without increasing the size of the final encoded message.) Using this encoding, the message encodes in only 13 bits to “0000010110111”, a compression ratio of 4.9 to 1 (that is,
each bit in the final encoded message represents as much information as did 4.9 bits in the original encoding). Read through this bit pattern from left to right and you’ll see that the prefix-free encoding makes it simple to decode this into the original text
even though the codes have varying bit lengths.
As a second example, consider the text “THE CAT IN THE HAT”. In this text, the letter “T” and the space character both occur with the highest frequency, so they will clearly have the shortest encoding bit patterns in an optimal encoding. The letters “C”, “I’
and “N” only occur once, however, so they will have the longest codes.
There are many possible sets of prefix-free variable-length bit patterns that would yield the optimal encoding, that is, that would allow the text to be encoded in the fewest number of bits. One such optimal encoding is to encode spaces with “00”, “A” with
“100”, “C” with “1110”, “E” with “1111”, “H” with “110”, “I” with “1010”, “N” with “1011” and “T” with “01”. The optimal encoding therefore requires only 51 bits compared to the 144 that would be necessary to encode the message with 8-bit ASCII encoding, a
compression ratio of 2.8 to 1.
Input
The input file will contain a list of text strings, one per line. The text strings will consist only of uppercase alphanumeric characters and underscores (which are used in place of spaces). The end of the input will be signalled by a line containing only the
word “END” as the text string. This line should not be processed.
Output
For each text string in the input, output the length in bits of the 8-bit ASCII encoding, the length in bits of an optimal prefix-free variable-length encoding, and the compression ratio accurate to one decimal point.
Sample Input
AAAAABCD
THE_CAT_IN_THE_HAT
END
Sample Output
64 13 4.9
144 51 2.8
Source
Greater New York 2000
Recommend
We have carefully selected several similar problems for you: 2037 1045 1301 3177 1055
题目有毒,讲个哈夫曼编码讲这么长。。。。
哈夫曼编码按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。本题用一开始字符出现的次数作为概率。。。
特别情况就是如果字符串只有一个字符的时候。。
#include <iostream> #include <cstdio> #include <queue> #include <cstring> #include <cmath> using namespace std; const int maxn = 2000; int i,j,k,len; char s[maxn]; int a[50]; priority_queue<int,vector<int>,greater<int> >que; void huffman(){ int code = 0; int x,y,z; while (que.size()!=1) { x = que.top(); que.pop(); y = que.top(); que.pop(); z = x+y; code += z; que.push(z); } len *= 8; printf("%d %d %.1lf\n",len,code,(double)len/(double)code); } int main(){ while (scanf("%s",s)) { if (strcmp(s,"END")==0) break; while(!que.empty()) que.pop(); memset(a,0,sizeof(a)); len = strlen(s); for (i=0; i<len; i++) a[s[i]-'A']++; for (i=0; i<50; i++) if (a[i]) que.push(a[i]); if (que.size()==1) printf("%d %d %.1lf\n",8*len,len,8.0); else huffman(); } return 0; }
相关文章推荐
- HDOJ 1053 Huffman编码 自写优先队列的ADT 权当做练习数据结构
- 九、堆和优先队列---(5)优先队列解决哈夫曼编码
- 优先队列解决哈夫曼编码问题
- [优先队列]HDOJ5360 Hiking
- 优先队列实现哈夫曼编码(贪心法)
- 优先队列实现 大小根堆 解决top k 问题
- hdoj 4302 Holedox Eating 【优先队列】
- hdoj 1896 Stones【优先队列】
- uva - 10954 - Add All(优先队列、哈夫曼编码思想)
- 优先队列解哈夫曼编码问题之带权路径长度
- 优先队列解决广搜的问题
- hdoj 1509 Windows Message Queue [STL 优先队列]
- [优先队列]HDOJ5289 Assignment
- HDOJ 1026 Ignatius and the Princess I (BFS优先队列超时 TLE)
- hdoj 1509 Windows Message Queue 【STL 优先队列】
- HDOJ 1509 Windows Message Queue (简单优先队列 )
- hdoj 3785 寻找大富翁 【水题】【优先队列 or sort】
- hdoj 5437 Alisha’s Party 【优先队列 模拟】