Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19238 Accepted Submission(s): 6505
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
2 3 911 97625999 91125426 5 113 12340 123440 12345 98346
Sample Output
NO YES
Source
题意:输入的号码中如果有任意一个号码是另一个号码的前缀,只能拨通最短的那个号码,所以输出NO,否则输出YES。
我的代码:(数组字典树)
#include <bits/stdc++.h>
using namespace std;
struct node
{
int next[10];
int cnt;
bool isWord;
void init()
{
cnt=0;
isWord=false;
memset(next,-1,sizeof(next));
}
}T[1000000];
int main()
{
int t,n;
for(scanf("%d",&t);t;t--)
{
int tot=1,flag=1; char s[100]; T[0].init();
for(scanf("%d",&n);n;n--)
{
scanf("%s",s); int len=strlen(s);
{
int i,p=0;
for(i=0;i<len;i++)
{
int x=s[i]-'0';
if(T[p].next[x]==-1)
{
T[tot].init();
T[p].next[x]=tot++;
}
p=T[p].next[x];
T[p].cnt++;
if(T[p].isWord) flag=0; //包含其它串
}
T[p].isWord=true;
if(T[p].cnt>1) flag=0; //包含于其它串
}
}
printf("%s\n",flag?"YES":"NO");
}
return 0;
}
思路:所有号码按照字典序进行排序,(sort函数可以实现字典排序),然后遍历所有数,看前一个数是否是后一个数的前缀
注意:
定义string s[100];
输入不能用 scanf("%s", s[i]);和strlen(s[i])
因为string类型不是单纯的字符串,不能用%s表示,而string里面应该放的是字符串的名字,
输入改成 cin>>s[i];就对了
求长度要用s.length(),或者s.size()。
对于string类型也不能用sizeof(s[0]);这样的话无论怎样,输出结果都是一样的。
如果对定义的字符串数组string s[100]按照字典序排序,可以用sort(s, s+n);
c++里面定义string变量用的应该是#include<string>。