HDU 1671 Phone List（字典树模板）

Dear 丶 2022-09-28 14:24 206阅读 0赞

<table style="font-family:&quot;Times New Roman&quot;; word-wrap:break-word"> 
 <tbody> 
  <tr> 
   <td> 
    <div style="word-wrap:break-word; width:980px; margin-top:10px">  
     <div style=""> 
      <span style="margin-right:20px"><a href="http://acm.hdu.edu.cn/discuss/public/post/reply.php?postid=31672&amp;messageid=1&amp;deep=0" style="color:red" rel="nofollow">布~</a></span> 
     </div>  
    </div> </td> 
  </tr> 
  <tr> 
   <td align="center"> <h1 style="color:rgb(26,92,200)">Phone List</h1> <strong><span style="font-family:Arial; color:green">Time Limit: 3000/1000 MS (Java/Others)&nbsp;&nbsp;&nbsp;&nbsp;Memory Limit: 32768/32768 K (Java/Others)<br> Total Submission(s): 19272&nbsp;&nbsp;&nbsp;&nbsp;Accepted Submission(s): 6517<br> </span></strong><br> <br> 
    <div style="height:38px; padding:0px 14px; color:rgb(124,169,237); font-size:18px; font-family:Arial; font-weight:bold">
      Problem Description 
    </div> 
    <div style="height:auto; margin:0px; padding:0px 20px; font-size:14px; font-family:&quot;Times New Roman&quot;; text-align:left">
      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: 
     <br> 1. Emergency 911 
     <br> 2. Alice 97 625 999 
     <br> 3. Bob 91 12 54 26 
     <br> 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. 
     <br> 
    </div> 
    <div style="height:auto; margin:0px">
      &nbsp; 
    </div> <br> 
    <div style="height:38px; padding:0px 14px; color:rgb(124,169,237); font-size:18px; font-family:Arial; font-weight:bold">
      Input 
    </div> 
    <div style="height:auto; margin:0px; padding:0px 20px; font-size:14px; font-family:&quot;Times New Roman&quot;; text-align:left">
      The first line of input gives a single integer, 1 &lt;= t &lt;= 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 &lt;= n &lt;= 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits. 
    </div> 
    <div style="height:auto; margin:0px">
      &nbsp; 
    </div> <br> 
    <div style="height:38px; padding:0px 14px; color:rgb(124,169,237); font-size:18px; font-family:Arial; font-weight:bold">
      Output 
    </div> 
    <div style="height:auto; margin:0px; padding:0px 20px; font-size:14px; font-family:&quot;Times New Roman&quot;; text-align:left">
      For each test case, output “YES” if the list is consistent, or “NO” otherwise. 
    </div> 
    <div style="height:auto; margin:0px">
      &nbsp; 
    </div> <br> 
    <div style="height:38px; padding:0px 14px; color:rgb(124,169,237); font-size:18px; font-family:Arial; font-weight:bold">
      Sample Input 
    </div> 
    <div style="height:auto; margin:0px; padding:0px 20px; font-size:14px; font-family:&quot;Times New Roman&quot;; text-align:left"> 
     <pre style="word-wrap:break-word; white-space:pre-wrap; margin-top:0px; margin-bottom:0px">
      
       
      <div style="font-family:&quot;Courier New&quot;,Courier,monospace">
       
        
       2
3
911
97625999
91125426
5
113
12340
123440
12345
98346
      
       
      </div></pre> 
    </div> 
    <div style="height:auto; margin:0px">
      &nbsp; 
    </div> <br> 
    <div style="height:38px; padding:0px 14px; color:rgb(124,169,237); font-size:18px; font-family:Arial; font-weight:bold">
      Sample Output 
    </div> 
    <div style="height:auto; margin:0px; padding:0px 20px; font-size:14px; font-family:&quot;Times New Roman&quot;; text-align:left"> 
     <pre style="word-wrap:break-word; white-space:pre-wrap; margin-top:0px; margin-bottom:0px">
      
       
      <div style="font-family:&quot;Courier New&quot;,Courier,monospace">
       
        
       NO
YES
      
       
      </div></pre> 
    </div> 
    <div style="height:auto; margin:0px">
      &nbsp; 
    </div> <br> 
    <div style="height:38px; padding:0px 14px; color:rgb(124,169,237); font-size:18px; font-family:Arial; font-weight:bold">
      Source 
    </div> 
    <div style="height:auto; margin:0px; padding:0px 20px; font-size:14px; font-family:&quot;Times New Roman&quot;; text-align:left"> 
     <a href="http://acm.hdu.edu.cn/search.php?field=problem&amp;key=2008+%A1%B0Insigma+International+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A83%A3%A9&amp;source=1&amp;searchmode=source" style="color:rgb(26,92,200)" rel="nofollow">2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up（3）</a> 
    </div> </td> 
  </tr> 
 </tbody> 
</table>

#define _CRT_secure_NO_WARNINGS
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <string>
    #include <algorithm>
    
    using namespace std;
    char str[10005][15];
    
    struct Trie
    {
        int cnt;
        struct Trie *next[10];
        Trie():cnt(0)
        {
            memset(next,0,sizeof(next));
        }
    };
    
    Trie *root = NULL;
    
    void Trie_insert(char *str)
    {
        Trie *p = root;
        for(int i=0;i<strlen(str);i++)
        {
            if(p -> next[str[i] - '0'] == NULL)
            {
                p -> next[str[i] - '0'] = new Trie;
            }
            p = p -> next[str[i] -'0'];
            p ->cnt++;
        }
    }
    int Trie_search(char *str)
    {
        Trie *p = root;
        for(int i=0;i<strlen(str);i++)
        {
            p = p -> next[str[i] - '0'];
        }
        if(p -> cnt != 1)
            return 0;
        return 1;
    }
    void del(Trie *root)
    {
        if(root == 0)
            return;
        for(int i=0;i<10;i++)
        {
            if(root -> next[i])
                del(root -> next[i]);
        }
        delete root;
    }
    int main()
    {
        int t;
        cin>>t;
        while(t--)
        {
            int n;
            cin>>n;
            root = new Trie;
            for(int i=1;i<=n;i++)
            {
                cin>>str[i];
                Trie_insert(str[i]);
            }
            bool flag = true;
            for(int i=1;i<=n;i++)
            {
                if(!Trie_search(str[i]))
                {
                    flag = false;
                    break;
                }
            }
            if(flag)
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;
                del(root);
        }
        return 0;
    }