Phone List（C++ vector容器）

绝地灬酷狼 2022-08-02 07:02 237阅读 0赞

# Phone List #

**Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)  
Total Submission(s): 12940    Accepted Submission(s): 4405**

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.

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

[2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up（3）][2008 _Insigma International Cup_ Zhejiang Collegiate Programming Contest - Warm Up_3]

#include<cstdio>
    #include<vector>
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    int main()
    {
        int t,n,i,flag;
        string s;
        cin>>t;
        while(t--)
        {
            vector<string>vec;
            cin>>n;
            flag=0;
            for(i=1;i<=n;i++)
            {
                cin>>s;
                vec.push_back(s);
            }
            sort(vec.begin(),vec.end());
            for(i=0;i<n-1;i++)
            {
                if(vec[i+1].find(vec[i])==0)//从开始找的！
                {
                    cout<<"NO"<<endl;
                    flag=1;
                }
                if(flag)
                {
                    break;
                }
            }
            if(!flag)
            {
                cout<<"YES"<<endl;
            }
        }
    }

[2008 _Insigma International Cup_ Zhejiang Collegiate Programming Contest - Warm Up_3]: http://acm.hdu.edu.cn/search.php?field=problem&key=2008+%A1%B0Insigma+International+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A83%A3%A9&source=1&searchmode=source