HDU 1671 Phone List
来源:互联网 发布:旅行到宇宙边缘 知乎 编辑:程序博客网 时间:2024/06/06 08:51
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
还以为是个简单的枚举 但是有一万组 怎么优化都是超时 无奈百度了下 用到了STRNCMP和快排…………
#include<iostream>#include<algorithm>#include<cstring>using namespace std;char a[10000][11];int cmp(const void* a,const void* b){ return strcmp((char*)a,(char*)b);}int main(void){ int t; scanf("%d",&t);tt: while(t--) { int i,n; bool flag=false; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s",a[i]); } qsort(a,n,sizeof(a[0]),cmp); for(i=0;i<n-1;i++) { if(strncmp(a[i],a[i+1],strlen(a[i]))==0) { printf("NO\n");goto tt; } }printf("YES\n"); } return 0;}
0 0
- Phone List 1671hdu
- 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
- Phone List hdu 1671
- hdu 1671 Phone List
- hdu 1671 Phone List
- HDU 1671 Phone List(
- hdu 1671 Phone List
- app应用分析
- Android视频渲染: YUV转RGB
- X264编码的一些收藏
- 数据库设计三大范式
- sizeof总结(转载)
- HDU 1671 Phone List
- [分析总结:leetcode-Palindrome Linked List] 给定单链表,判断链表是否为回文。
- 银行储蓄系统
- 中国车辆牌照尺寸
- OpenLayers开发:添加地标
- 安装编译MySQL5.5.28
- 学会读懂 MySql 的慢查询日志
- CentOS修改ulimit(最大进程数和最大文件打开数)
- Could not open Selected VM debug port (8700)