HDU1671 Phone List(字典树)
来源:互联网 发布:娱乐圈的水有多深知乎 编辑:程序博客网 时间:2024/04/28 17:17
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
题意: 看每个串的字串是否会与别的串相同,有则输出 NO, else 输出YES
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<stack>#include<vector>#include<set>#include<map>#define L(x) (x<<1)#define R(x) (x<<1|1)#define MID(x,y) ((x+y)>>1)#define eps 1e-8typedef __int64 ll;using namespace std;#define N 10struct node{ bool flag; node *nest[N];};node *root;char phone[10050][20];void inset(char *c){ node * tem=root; while(*c!='\0'){if(tem->nest[*c-'0']==NULL){node * cur;cur=(node *)malloc(sizeof(node));for(int i=0;i<N;i++)cur->nest[i]=NULL;cur->flag=false;tem->nest[*c-'0']=cur;}tem=tem->nest[*c-'0'];c++;}tem->flag=true;}int seach(char *c){int i,j;node * temp=root;while(*c!='\0'){if(temp==NULL||temp->nest[*c-'0']==NULL)return 0;temp=temp->nest[*c-'0'];c++;}return temp->flag;}void delet(node* temp){if(temp==NULL) return ;for(int i=0;i<N;i++)if(temp->nest[i]!=NULL) delet(temp->nest[i]); free(temp);}void inint(){int i,j;root=(node *) malloc(sizeof(node));root->flag=false;for(i=0;i<N;i++)root->nest[i]=NULL;}int main(){ int i,j,t,n; scanf("%d",&t); while(t--) { inint(); scanf("%d",&n); for(i=0;i<n;i++){scanf("%s",phone[i]);inset(phone[i]);} int flag=1; char c[20]; for(i=0;i<n;i++){if(!flag) break; int len=strlen(phone[i]); memset(c,'\0',sizeof(c)); for(j=0;j<len-1;j++){ c[j]=phone[i][j]; if(seach(c)) { flag=0; break; }}}if(flag)printf("YES\n");elseprintf("NO\n"); delet(root); } return 0;}
0 0
- HDU1671 Phone List(字典树)
- hdu1671 Phone List (字典树)
- hdu1671 Phone List (字典树)
- hdu1671 Phone List(字典树)
- HDU1671:Phone List(字典树)
- 【字典树】 hdu1671 Phone List
- Phone List(hdu1671字典树)
- hdu1671 Phone List (字典树)
- HDU1671 Phone List【字典树】
- HDU1671 Phone List (字典树)
- hdu1671-Phone List 字典树
- [复习][HDU1671]字典树(trie树)phone list
- hdu1671 Phone List(简单字典树,注意超空间)
- HDU1671 Phone List 解题报告--字典树
- HDU1671 poj3630 Phone List 字典树
- hdu1671 Phone List 字典树(小组赛E)
- hdu1671 Phone List (trie树)
- HDU1671 Phone List(必须删除字典树,否则Memory Limit Exceeded)
- trie树(前缀树)
- maven工程pom.xml的依赖查找网站
- 数据库事务隔离级别
- HDU 2830 Matrix Swapping II (最大列可移动子矩形面积)
- rabbitmq集群安装
- HDU1671 Phone List(字典树)
- OpenCV Using Python——HSV颜色空间和改进的YCbCr颜色空间中的肤色检测
- SQL Server AlwaysOn 和 ILB
- poj 2182——Lost Cows
- 那两年炼就的Android内功修养 ( 老罗 )
- 学习笔记:int 和 size_t互转的最好解决方案
- 基于百度翻译API开发属于自己的翻译工具
- 杭电 rescue(经典广搜)(深搜广搜对比)
- How To Install MongoDB On Mac OS X