Data Structures and Algorithms (English) - 7-9 Huffman Codes（30 分）

#include<bits/stdc++.h>#include<cmath>#define mem(a,b) memset(a,b,sizeof a)#define ssclr(ss) ss.clear(), ss.str("")#define INF 0x3f3f3f3f#define MOD 1000000007usingnamespacestd;
typedeflonglongll;
structnode{
intw;
strings;
}nds[70];
priority_queue<int,vector<int>,greater<int>>pq;
unordered_map<char,int>ump;
intn;
boolok()
{
for(inti=0;i<n;i++)
    {
stringpre=nds[i].s;
for(intj=0;j<n;j++)
        {
if(i!=j&&pre==nds[j].s.substr(0,pre.length()))
returnfalse;
        }
    }
returntrue;
}
intmain()
{
intm,wpl=0;
charc;
scanf("%d ",&n);
for(inti=0;i<n;i++)
    {
scanf("%c",&c);
scanf("%d ",&ump[c]);
pq.push(ump[c]);
    }
while(1)
    {
inttp=pq.top(); pq.pop();
if(pq.empty()) break;
tp+=pq.top(); pq.pop();
pq.push(tp);
wpl+=tp;
    }
scanf("%d",&m);
while(m--)
    {
intsum=0;
for(inti=0;i<n;i++)
        {
scanf(" %c",&c);
cin>>nds[i].s;
nds[i].w=ump[c];
sum+=nds[i].w*nds[i].s.length();
        }
if(sum==wpl&&ok()) puts("Yes");
elseputs("No");
    }
return0;
}