Poj 1451 T9 dictionary tree + priority queue

Source: poj 1451 T9

Question: give you some words and priorities. When you press the number, the first word that appears is the button on our mobile phone.

Ideas: to create a dictionary tree, because one number corresponds to multiple letters, we need to output the largest weight. I used the priority queue. Here, the priority of each prefix is that all words are given priority. sum of Values

For example, ABC 5 Abd 6 ACD 7, the priority of a prefix is 18 AB, and the priority is 11.

#include <cstdio>#include <cstring>#include <queue>using namespace std;const int maxnode = 100010;const int sigma_size = 26;const int maxn = 1010;int ch[maxnode][sigma_size];int val[maxnode];int sz;char s[maxn][110];char id[12][6] = {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};void init(){sz = 1;memset(ch[0], 0, sizeof(ch[0]));}struct node{int u, v, x;char str[110];node(){}node(int _u, int _v, int _x, char* s){u = _u;v = _v;x = _x;strcpy(str, s);}bool operator < (const node& rhs) const{if(v != rhs.v)return v > rhs.v;return x < rhs.x;}};int idx(char c){if(c >= 'a' && c <= 'c')return 2;if(c >= 'd' && c <= 'f')return 3;if(c >= 'g' && c <= 'i')return 4;if(c >= 'j' && c <= 'l')return 5;if(c >= 'm' && c <= 'o')return 6;if(c >= 'p' && c >= 's')return 7;if(c >= 't' && c <= 'v')return 8;if(c >= 'w' && c <= 'z')return 9;}void insert(char *s, int v){int u = 0, n = strlen(s);for(int i = 0; i < n; i++){int c = s[i] - 'a';if(!ch[u][c]){memset(ch[sz], 0, sizeof(ch[sz]));val[sz] = 0;ch[u][c] = sz++;}u = ch[u][c];val[u] += v;}//val[u] += v;}void find(char *s){int u = 0, n = strlen(s);priority_queue <node> Q;Q.push(node(0, 0, 0, ""));for(int i = 0; i < n-1; i++){int c = s[i]-'0';while(!Q.empty()){node x = Q.top();if(x.v != i)break;Q.pop();u = x.u;for(int j = 0; id[c][j]; j++){int v = id[c][j] - 'a';//printf("%d\n", v);if(!ch[u][v])continue;v = ch[u][v];x.str[i] = id[c][j];x.str[i+1] = 0;//printf("%c\n", id[c][j]);Q.push(node(v, i+1, val[v], x.str));}}if(Q.empty()){puts("MANUALLY");}else{node x = Q.top();printf("%s\n", x.str);}}}int main(){int cas = 1;int T;scanf("%d", &T);while(T--){int n, m;scanf("%d", &n);init();for(int i = 0; i < n; i++){//char s[maxn];int x;scanf("%s %d", s[i], &x);insert(s[i], x);}printf("Scenario #%d:\n", cas++);scanf("%d", &m);while(m--){char str[210];scanf("%s", str);find(str);puts("");}puts("");}return 0;}