POJ 3630 Phone List
2014-08-30 18:42
239 查看
Phone List
Time Limit: 1000msMemory Limit: 65536KB
This problem will be judged on PKU. Original ID: 3630
64-bit integer IO format: %lld Java class name: Main
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
Source
Nordic 2007解题:trie
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <climits> #include <vector> #include <queue> #include <cstdlib> #include <string> #include <set> #include <stack> #define LL long long #define pii pair<int,int> #define INF 0x3f3f3f3f using namespace std; struct trie { int wd[10]; bool flag; void init() { memset(wd,-1,sizeof(wd)); flag = false; } }; trie dic[100000]; int tot,n; char str[10010]; bool insertWd(int root,char *s) { for(int i = 0; s[i]; i++) { if(dic[root].flag) return false; if(dic[root].wd[s[i]-'0'] == -1) { dic[tot].init(); dic[root].wd[s[i]-'0'] = tot++; } root = dic[root].wd[s[i]-'0']; } for(int i = 0; i < 10; i++) if(dic[root].wd[i] > 0) return false; if(dic[root].flag) return false; return dic[root].flag = true; } int main() { int t,root = 0; scanf("%d",&t); while(t--) { tot = 1; dic[0].init(); scanf("%d",&n); bool flag = true; while(n--) { scanf("%s",str); if(flag) flag = insertWd(root,str); } flag?puts("YES"):puts("NO"); } return 0; }
View Code
相关文章推荐
- POJ-3630-Phone List-Trie树(键树、数字查找树、基数树)
- poj 3630 || hdu 1671 Phone List (字典树)
- POJ 题目3630 Phone List(字符串,水)
- POJ 3630 Phone List
- POJ 3630 , HDU 1671 Phone List - from lanshui_Yang
- poj 3630 Phone List( 简单字典树 )
- POJ 3630 Phone List 【Trie树入门】
- POJ 3630 Phone List 字典树
- POJ3630 Phone List 题解&代码
- poj 3630 Phone List
- POJ -- 3630 Phone List(Trie 树)
- HDU 1671 & POJ 3630 Phone List(字典树基础题)
- poj 1056 IMMEDIATE DECODABILITY & poj 3630 Phone List
- HDU 1671 Phone List && POJ 3630 Phone List
- POJ 3630- Phone List(Trie)
- POJ 3630 Phone List/POJ 1056 【字典树】
- 【POJ】3630 Phone List
- poj3630—Phone List(字典树)
- POJ 3630-Phone List【比较许多字符中有没有一个是另一个的前缀,简单方法】
- HDU 1671 POJ 3630 Phone List