poj3630 Phone List (trie树模板题)
2016-01-26 23:01
369 查看
Phone List
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:
Emergency 911
Alice 97 625 999
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
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 26328 | Accepted: 7938 |
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:
Emergency 911
Alice 97 625 999
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树模板题; AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int N=100010; char str[N][10]; int t,n,cnt,trie[N][20],flag,val[N]; void build_checktrie(char*s,int v) { int len=strlen(s),u=0; for(int i=0;i<len;i++) { int num=s[i]-'0'; if(!trie[u][num]) { for(int j=0;j<=10;j++) { trie[cnt][j]=0; } val[cnt]=0; trie[u][num]=cnt++; } else { if(i==len-1) { flag=0; } if(val[trie[u][num]]) { flag=0; } } u=trie[u][num]; } val[u]=v; } int main() { scanf("%d",&t); while(t--) { memset(trie,0,sizeof(trie)); memset(val,0,sizeof(val)); cnt=1; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%s",str[i]); } flag=1; for(int i=1;i<=n;i++) { build_checktrie(str[i],1); if(!flag)break; } if(flag)printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- PHP区分大小写:函数名和类名不区分,变量名区分
- 2016 NOI冬令营
- Python CGI初体验
- 【莫比乌斯反演】[SPOJ-PGCD]Primes in GCD Table
- Android基础之通知的使用
- hdu acm hdu 2115 Java
- Python CGI初体验
- Javascript常见知识点
- 前端实战(一)-----用ps把PSD切成HTML能用的图片
- 我的移动端网页搭建01——简单布局01(header-content-footer-navbar)
- 一步步实现带动画效果的下拉刷新
- 蓝懿ios技术交流和心得分享16.1.26
- hdu 1233 还是畅想工程(prim算法)
- 前端实战(一)-----用ps把PSD切成HTML能用的图片
- Lambda函数
- 学习Discuz! X3.2记录:门户首页DIY之显示文章列表
- Android Studio 格式化 Format代码快捷键问题
- win 10系统安装myeclipse 9.1 破解问题
- Lambda函数
- spring mvc javaConfig版本搭建常见问题