HDU 1671 (Trie 字典树)
来源:互联网 发布:直播软件 编辑:程序博客网 时间:2024/05/17 16:01
#include <stdio.h>#include <iostream>#include <string.h>#include <stdlib.h>#define MAX 50021using namespace std;typedef struct trie{ trie *next[26]; int v;}trie;trie *root;void creat_trie(char str[]){ int len = strlen(str); trie *p = root; for(int i=0; i<len; ++i) { int id = str[i]-'0'; if(p->next[id] == NULL) { p->next[id] = (trie *)malloc(sizeof(trie)); p->next[id]->v = 1; p = p->next[id];for(int j=0; j<26; ++j) p->next[j] = NULL; } else { p->next[id]->v++; p = p->next[id]; } } p->v = -1;}int find_trie(char str[]){ int len = strlen(str);trie *pp = root;for (int i=0;i<len;i++){int id = str[i] - '0';pp = pp->next[id];if(pp == NULL)return 0; //没有符合if(pp->v == -1) //字符集中某串为此字符串的前缀return -1; }return -1; // 此字符串为字符集中某串的前缀}int deal(trie *T){//这是把T清空,一开始没加这个,结果MLE. int i; if(T==NULL) return 0; for(i=0;i<26;i++) { if(T->next[i]!=NULL) deal(T->next[i]); } free(T); return 0;}int main(){int N,n,i,j,s,t,m,flag=0;int a,b,c,d;int sum;char str[15];scanf("%d",&n);while (n--){root = (trie *)malloc(sizeof(trie));for (i=0;i<26;i++){root->next[i] = NULL;}scanf("%d",&m);flag=0;while (m--){scanf("%s",str);if (find_trie(str) == -1) flag = 1; if(flag)continue;creat_trie(str);}if(flag)printf("NO\n");elseprintf("YES\n");deal(root); //否则会提示MLE}return 0;}
。。。。。。。。。。。。。。。。。
只能用字典树
Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12591 Accepted Submission(s): 4262
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)
0 0
- HDU 1671 (Trie 字典树)
- HDU 1671 静态trie(字典树)
- HDU 1671 Phone List(字典树Trie)
- 字典树 Trie (HDU 1671)
- HDU 1671 Phone List(字典树Trie)
- HDU 1671 Phone List(字典树Trie)
- HDU 1251 Trie字典树
- HDU 1671 Phone List 字典树-Trie数
- HDU 1671 Phone List 字典树(Trie)
- Trie 树(字典树)HDU 1251
- HDU 1251 统计难题(字典树Trie)
- Trie字典树应用HDU--1251
- HDU ACM 1251字典树(Trie)
- hdu 3460 Ancient Printer trie字典树
- HDU 1671 Trie树
- hdu 1671 trie树
- HDU 1671 trie树
- HDU 1671 phone list 数据结构+Trie树(字典树、前缀树)
- 2013 原油年报 2013,原油宽幅震动,N型向上
- Leetcode Problem.202—Happy Number
- Java学习 - 内存简介
- 卡耐基人性的弱点重要摘要
- wap 笔试题2015
- HDU 1671 (Trie 字典树)
- Hadoop中-put和-copyFromLocal的区别
- Leetcode Problem.203 —Remove Linked List Elements
- Android任务和返回栈完全解析,细数那些你所不知道的细节
- cygwin下运行shell脚本出现的错误
- Ehcache 整合Spring 使用页面、对象缓存
- 深入了解Struts1的运行机理
- CentOS 7安裝视频解码器
- 快速排序(小白入门专用,大神请无视)