HDU 1671 Trie树
来源:互联网 发布:linux文件管理web 编辑:程序博客网 时间:2024/05/17 01:14
Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14670 Accepted Submission(s): 4946
Problem Description
Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:
1. Emergency 911
2. Alice 97 625 999
3. Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.
Input
The first line of input gives a single integer, 1 <= t <= 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 <= n <= 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.
Output
For each test case, output “YES” if the list is consistent, or “NO” otherwise.
Sample Input
2
3
911
97625999
91125426
5
113
12340
123440
12345
98346
Sample Output
NO
YES
还是熟悉trie模板,注意要随时清内存
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <cstdlib>//#define LOCALusing namespace std;typedef struct trie{ int v; struct trie* next[10];}Trie;Trie* root;char str[15];void createTrie(char* T);bool findTrie(char* str);void deal(Trie* T);int main(){#ifdef LOCAL freopen("data.in","r",stdin);#endif // LOCAL int N; scanf("%d",&N); while(N--){ int n; scanf("%d",&n); int i,j; root = (Trie*)malloc(sizeof(Trie)); for(i = 0;i<10;i++) root->next[i] = NULL; bool p = false; for(i = 0;i<n;i++){ scanf("%s",str); if(!p&&findTrie(str)){ p = true; } if(p) continue; createTrie(str); } if(p) printf("NO\n"); else printf("YES\n"); deal(root); } return 0;}bool findTrie(char* str){ int len = strlen(str); Trie* p = root; for(int i = 0;i<len;i++){ int id = str[i] - '0'; p = p->next[id]; if(p == NULL) return false; if(p->v == -1) return true; } return true;}void deal(Trie* T){ int i; if(T==NULL) return; for(i = 0;i<10;i++) if(T->next[i]!=NULL) deal(T->next[i]); free(T);}void createTrie(char* str){ Trie* p = root,*q; int len = strlen(str); int i; for(i = 0;i<len;i++){ int id = str[i] - '0'; if(p->next[id] == NULL){ q = (Trie*)malloc(sizeof(Trie)); q->v = 1; for(int j = 0;j<10;j++) q->next[j] = NULL; p->next[id] = q; }else p->next[id]->v++; p = p->next[id]; } p->v = -1;}
- HDU 1671 Trie树
- hdu 1671 trie树
- HDU 1671 trie树
- Trie树入门:HDU 1671
- HDU 1671 (Trie 字典树)
- HDU 1671 静态trie(字典树)
- hdu 1671 Phone List (Trie树,水题)
- hdu 1671 Phone List trie树
- HDU 1671 Phone List(字典树Trie)
- 字典树 Trie (HDU 1671)
- HDU 1671 Phone List Trie树
- Phone List - HDU 1671 Trie树
- HDU 1671 Phone List(字典树Trie)
- hdu-1671-Phone List Trie树
- hdu 1671 Phone List(Trie树)
- hdu 1671 Trie树简单应用
- HDU 1671 Phone List trie树
- HDU 1671——Trie树应用
- 计算身体质量指数
- poj1151矩形面积并
- Intersecting Lines(直线相交判断,求相交交点)
- Xcode常用快捷键
- hdu4474 bfs搜索
- HDU 1671 Trie树
- 137. Single Number II
- 学习新东西的动力
- 64位win7下安装numpy,scipy,matplotlib
- 纯净版Ubuntu系统安装web服务器需要安装的库
- Fiddler实现App前后端隔离开发
- 1091. Acute Stroke (30)
- Java基础IO流概述、字符流、字节流、流操作规律、File类、Properties类、打印流、序列流
- OC对象中拥有对象