zoukankan      html  css  js  c++  java
  • poj--3630--Phone List(字典树+前缀判断)

    Time Limit: 1000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u

    Status

    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

    2
    3
    911
    97625999
    91125426
    5
    113
    12340
    123440
    12345
    98346

    Sample Output

    NO
    YES

    Source




    #include<stdio.h>
    #include<string.h>
    char str[100000+10][50];
    int ch[100010][50];
    int word[100010];
    int sz;
    void init()
    {
    	sz=1;
    	memset(ch[0],0,sizeof(ch[0]));
    	memset(word,0,sizeof(word));
    }
    void insert(char *s)
    {
    	int l=strlen(s);
    	int u=0;
    	for(int i=0;i<l;i++)
    	{
    		int c=s[i]-'0';
    		if(!ch[u][c])
    		{
    			memset(ch[sz],0,sizeof(ch[sz]));
    			ch[u][c]=sz;
    			sz++;
    		}
    		u=ch[u][c];
    		word[u]++;
    	}
    }
    int find(char *s)
    {
    	int l=strlen(s);
    	int u=0;
    	for(int i=0;i<l;i++)
    	{
    		int c=s[i]-'0';
    		u=ch[u][c];
    		if(word[u]==1)
    		return 1;
    	}
    	return 0;
    }
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		init();
    		int n;
    		scanf("%d",&n);
    		for(int i=0;i<n;i++)
    		{
    			scanf("%s",str[i]);
    			insert(str[i]);
    		}
    		int flog=1;
    		for(int i=0;i<n;i++)
    		{
    			if(!find(str[i]))
    			{
    				flog=0;
    				break;
    			}
    		}
    		if(flog)
    		printf("YES
    ");
    		else printf("NO
    ");
    	}
    	return 0;
    }


  • 相关阅读:
    MacOS更改zsh命令行前缀
    python中os._exit()和sys.exit(), exit(0)和exit(1) 的用法和区别
    如何解析 redis 的 rdb 文件
    流量回放工具<二>
    策略路由配置<一>
    h3c镜像模式配置
    python上传gz文件请求
    优先队列(大顶堆实现)
    bm和kmp和bf
    dedecms 软件下载模块加入flashget快车下载代码
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273760.html
Copyright © 2011-2022 走看看