hdu Phone List (字典树)
来源:互联网 发布:邢台seo外包 编辑:程序博客网 时间:2024/06/06 20:27
Phone List
Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 4 Accepted Submission(s) : 3
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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 <stdio.h>#include <string.h>int cnt;char phonum[10005][15];struct Node{ int next[10]; int flag;} tree[100000];void Insert(char *s){ int p = 0; while(*s){ if(tree[p].next[*s - '0'] == -1){ tree[p].next[*s - '0'] = cnt; cnt++; } p = tree[p].next[*s - '0']; s++; } tree[p].flag = 1;}int Query(char *s){ int p = 0; while(*s){ if(tree[p].flag == 1){ return 0; } else{ p = tree[p].next[*s - '0']; } s++; } return 1;}int main (){ int i,T,n; int flag; scanf("%d",&T); while(T--){ flag = 1; cnt = 1; for(i = 0;i < 100000;i++){ memset(tree[i].next,-1,sizeof(tree[i].next)); tree[i].flag = 0; } for(i = 0 ;i < 10005;i++){ memset(phonum[i],'\0',sizeof(phonum[i])); } scanf("%d",&n); for(i = 0;i < n;i++){ scanf("%s",phonum[i]); Insert(phonum[i]); } for(i = 0;i < n;i++){ if(Query(phonum[i]) == 0){ flag = 0; } } if(flag == 0){ printf("NO\n"); } else{ printf("YES\n"); } } return 0;}
- hdu Phone List (字典树)
- 【hdu】Phone List (字典树)
- hdu 1671 Phone List(字典树)
- HDU-#1671 Phone List(字典树)
- hdu 1671 phone list(字典树)
- HDU 1671 Phone List(字典树)
- HDU 1671 Phone List(字典树)
- HDU 1671 Phone List(字典树)
- HDU 1671 Phone List(字典树)
- HDU 1671 Phone List (字典树)
- HDU 1671 Phone List(字典树)
- hdu 1671 Phone List(字典树)
- HDU 1671 Phone List (字典树)
- HDU 1671 Phone List(字典树)
- hdu 1671 Phone List(字典树)
- HDU 1671 Phone List(字典树)
- hdu Phone List 字典树
- 【HDU】1671 - Phone List(字典树(动态建树))
- ubuntu 12.04更新源
- java银行业务调度系统
- 让Java代码跑得更快
- 我在各个系统所喜欢用的软件
- 【转】mipi介绍
- hdu Phone List (字典树)
- 登陆窗体显示动态效果
- 思科的网络容错技术
- AJAX 跨域请求 - JSONP获取JSON数据
- HDOJ 1757 – A Simple Math Problem
- 浅析闭包在缓存逻辑中的一次应用
- 思科的网络安全技术
- Java内部类
- vb.net 调式 检测到loaderlock错误 (已解决)