POJ 1056 IMMEDIATELY DECODABILITY(Trie字典樹的應用)
阿新 • • 發佈:2019-02-14
#include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <algorithm> #include <cmath> #include <vector> #include <queue> const int MAXN = 100000 + 10; typedef struct Trie_Node { bool isword; struct Trie_Node *next[2]; }Trie; bool ok; void insert(Trie *root, char *word) { int i = 0; Trie *p = root; while(word[i] != '\0') { if(p->next[word[i]-'0'] == NULL) { Trie *temp = new Trie; temp->isword =false; for(int j=0;j<2;j++) temp->next[j] = NULL; p->next[word[i]-'0'] = temp; } else if(p->next[word[i]-'0']->isword) { ok = false; return ; } p = p->next[word[i]-'0']; i++; } p->isword = true; } void del(Trie *root) { for(int i=0;i<2;i++) { if(root->next[i] != NULL) del(root->next[i]); } free(root); } int main() { int kcase = 1; char s[30]; while(scanf("%s", s)!=EOF) { Trie *root = new Trie; root->isword = false; for(int i=0;i<2;i++) root->next[i] = NULL; ok = true; insert(root, s); while(scanf("%s", s)) { if(strcmp(s,"9") == 0) break; if(ok) insert(root, s); } if(ok) printf("Set %d is immediately decodable\n",kcase++); else printf("Set %d is not immediately decodable\n", kcase++); del(root); } return 0; }