HDU 1671 (字典树统计是否有前缀)
来源:互联网 发布:qsv格式转换工具 mac 编辑:程序博客网 时间:2024/06/05 11:50
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1671
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.
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
2391197625999911254265113123401234401234598346
Sample Output
NOYES
Source
2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(3)
题意:
统计是否有相同的前缀!
代码如下:
#include <cstdio>#include <cstring>#include <malloc.h>#include <iostream>using namespace std;#define MAXN 10typedef struct Trie{ int v;//根据需要变化 Trie *next[MAXN]; //next是表示每层有多少种类的数,如果只是小写字母,则26即可, //若改为大小写字母,则是52,若再加上数字,则是62了}Trie;Trie* root;void createTrie(char *str){ int len = strlen(str); Trie *p = root, *q; for(int i = 0; i < len; i++) { int id = str[i]-'0'; if(p->next[id] == NULL) { q = (Trie *)malloc(sizeof(Trie)); q->v = 1;//初始v==1 for(int j = 0; j < MAXN; j++) q->next[j] = NULL; p->next[id] = q; p = p->next[id]; } else { // p->next[id]->v++; p = p->next[id]; } } p->v = -1;//若为结尾,则将v改成-1表示}int 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 0; if(p->v == -1) //字符集中已有串是此串的前缀 return -1; } //return p->v; return -1; //此串是字符集中某串的前缀}int dealTrie(Trie* T){ //动态字典树,有时会超内存,这是就要记得释放空间了 if(T==NULL) return 0; for(int i = 0; i < MAXN; i++) { if(T->next[i]!=NULL) dealTrie(T->next[i]); } free(T); return 0;}int main(){ int t, n; char str[15]; scanf("%d",&t); while(t--) { int flag = 0; root = (Trie *)malloc(sizeof(Trie)); for(int i = 0; i < MAXN; i++) root->next[i] = NULL; scanf("%d",&n); for(int i = 0; i < n; i++) { scanf("%s",str); if(findTrie(str) == -1) { flag = 1; continue; } createTrie(str); } if(flag) printf("NO\n"); else printf("YES\n"); dealTrie(root); } return 0;}
3 0
- HDU 1671 (字典树统计是否有前缀)
- HDU 1251-统计难题(字典树-统计前缀串)
- HDU 1251 统计难题(字典树,统计前缀个数)
- HDU 1251 统计难题-字典树-统计前缀个数
- HDU 1251 统计难题(字典树(统计前缀数量) || map运用)
- HDU 1671-Phone List(字典树-前缀匹配)
- HDU 1671 字典树 查找前缀
- HDU-1251 统计难题(前缀树)
- 字典树-大量字符串前缀及出现次数是否存在统计(Trie树-java)算法实现
- 字典树-大量字符串前缀及出现次数是否存在统计(Trie树-java)算法实现
- HDU 1671 Phone List(字典树寻找前缀)
- HDU 3724 Encoded Barcodes(字典树,计算前缀数)
- HDU 1251 统计难题 (字典树基本模板,有详细注释)
- HDU 1251统计难题(字典树)
- hdu 1251 统计难题(字典树)
- hdu 1251 统计难题(字典树)
- hdu 1251 统计难题(字典树)
- hdu 统计难题(字典树)
- MapReduce(九): 任务的运行
- Vc List control Custom Draw
- ERROR 2003 (HY000): Can't connect to MySQL server on '192.168.56.105' (113)
- 二叉搜索树 ( 二叉查找树)( 二叉排序树)的定义和遍历
- java 超简单webservice 教程
- HDU 1671 (字典树统计是否有前缀)
- 2014硕士面试经历一
- Linux共享内存机制
- 最重要的十年做什么才不浪费?
- android listview的总结
- iTextSharp 超复杂
- XTU—1190 Game of Wuxing
- gdb 调试
- linux 下 ssh证书登录