Safe Or Unsafe
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 195 Accepted Submission(s): 58
Problem Description
Javac++ 一天在看计算机的书籍的时候,看到了一个有趣的东西!每一串字符都可以被编码成一些数字来储存信息,但是不同的编码方式得到的储存空间是不一样的!并且当储存空间大于一定的值的时候是不安全的!所以Javac++ 就想是否有一种方式是可以得到字符编码最小的空间值!显然这是可以的,因为书上有这一块内容--哈夫曼编码(Huffman Coding);一个字母的权值等于该字母在字符串中出现的频率。所以Javac++ 想让你帮忙,给你安全数值和一串字符串,并让你判断这个字符串是否是安全的?
Input
输入有多组case,首先是一个数字n表示有n组数据,然后每一组数据是有一个数值m(integer),和一串字符串没有空格只有包含小写字母组成!
Output
如果字符串的编码值小于等于给定的值则输出yes,否则输出no。
Sample Input
2
12
helloworld
66
ithinkyoucandoit
Sample Output
no
yes
#include <iostream>
#include <cstring>
using namespace std;
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
typedef struct
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int weight;
int parent, lchild, rchild;
}HTNode, *HuffmanTree;
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
int charCnt[28];
HTNode HT[52];
int result, m;
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
void init()
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
for(int i = 0; i < 26; i++)
charCnt[i] = 0;
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
void traverse(int root, int height)
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
if(root)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
if(HT[root].lchild)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
traverse(HT[root].lchild, height + 1);
traverse(HT[root].rchild, height + 1);
}
else
result += HT[root].weight * height;
}
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
int getmin(int tt)
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int rr, mw, j = 1;
while(HT[j].parent)
j++;
rr = j; mw = HT[j].weight;
for(j++; j <= tt; j++)
if(HT[j].weight < mw && !HT[j].parent)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
rr = j;
mw = HT[j].weight;
}
HT[rr].parent = 1;
return rr;
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
void selectTwoMin(int tt, int &s1, int &s2)
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int kk;
s1 = getmin(tt);
s2 = getmin(tt);
if(s1 > s2)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
kk = s1;
s1 = s2;
s2 = kk;
}
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
int HuffmanCoding()
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int i;
int mm, min1, min2;
int cc = 1;//stand for the total count of leaf
for(i = 0; i < 26; i++)
if(charCnt[i])//节点0为空
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
HT[cc].weight = charCnt[i];
HT[cc].parent = HT[cc].lchild = HT[cc].rchild = 0;
cc++;
}
cc--;
if(cc == 1)
return 1;
mm = 2 * cc;
for(i = cc + 1; i < mm; i++)
HT[i].parent = 0;
for(i = cc + 1; i < mm; i++)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
selectTwoMin(i - 1, min1, min2);
//cout<<min1<<" "<<min2<<endl;
HT[min1].parent = HT[min2].parent = i;
HT[i].lchild = min1;
HT[i].rchild = min2;
HT[i].weight = HT[min1].weight + HT[min2].weight;
}
result = 0;
traverse(mm - 1, 0);
//cout<<"result:"<<result<<endl;
if(result > m)
cout<<"no"<<endl;
else
cout<<"yes"<<endl;
return 0;
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
int main()
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
char str[1000];
int n, i;
while(cin>>n)
while(n-- && cin>>m)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
cin>>str;
init();
for(i = 0; i < strlen(str); i++)
charCnt[str[i] - 'a']++;
if(HuffmanCoding())
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
if(strlen(str) > m)
cout<<"no"<<endl;
else
cout<<"yes"<<endl;
}
}
return 0;
}