strcmp() Anyone? uva+字典树+孩子兄弟建图方向构造字典树

strcmp() Anyone?

Time Limit: 2000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

[Submit]   [Go Back]   [Status]  

Description

J	“strcmp()” Anyone? Input: Standard Input Output: Standard Output

 

strcmp() is a library function in C/C++ which compares two strings. It takes two strings as input parameter and decides which one is lexicographically larger or smaller: If the first string is greater then it returns a positive value, if the second string is greater it returns a negative value and if two strings are equal it returns a zero. The code that is used to compare two strings in C/C++ library is shown below:

int strcmp(char *s, char *t) {     int i;     for (i=0; s[i]==t[i]; i++)         if (s[i]=='\0')             return 0;     return s[i] - t[i]; }

Figure: The standard strcmp() code provided for this problem.

 

The number of comparisons required to compare two strings in strcmp() function is never returned by the function. But for this problem you will have to do just that at a larger scale. strcmp() function continues to compare characters in the same position of the two strings until two different characters are found or both strings come to an end. Of course it assumes that last character of a string is a null (‘\0’) character. For example the table below shows what happens when “than” and “that”; “therE” and “the” are compared using strcmp() function. To understand how 7 comparisons are needed in both cases please consult the code block given above.

 

t

h

a

N

\0

t

h

e

r

E

\0

=

=

=

≠

=

=

=

≠

t

h

a

T

\0

t

h

e

\0

Returns negative value 7 Comparisons

Returns positive value 7 Comparisons

 

Input

The input file contains maximum 10 sets of inputs. The description of each set is given below:

 

Each set starts with an integer N (0<N<4001) which denotes the total number of strings. Each of the next N lines contains one string. Strings contain only alphanumerals (‘0’… ‘9’, ‘A’… ‘Z’, ‘a’… ‘z’) have a maximum length of 1000, and a minimum length of 1.  

 

Input is terminated by a line containing a single zero. Input file size is around 23 MB.

 

Output

For each set of input produce one line of output. This line contains the serial of output followed by an integer T. This T denotes the total number of comparisons that are required in the strcmp() function if all the strings are compared with one another exactly once. So for N strings the function strcmp() will be called exactly  times. You have to calculate total number of comparisons inside the strcmp() function in those  calls. You can assume that the value of T will fit safely in a 64-bit signed integer. Please note that the most straightforward solution (Worst Case Complexity O(N² *1000)) will time out for this problem.

 

Sample Input                              Output for Sample Input

2 a b 4 cat hat mat sir 0

Case 1: 1 Case 2: 6

---

解决方案：仔细观察题目所给的代码，你会发现，若两串完全相同，这要比较(strlen(word)+1)*2次，其它情况均为相同前缀s的为strlen(s)*2+1。

还有这次建立字典树用到了兄弟孩子建树法，head指向孩子节点，next指向兄弟节点。

code:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int nmax=4000*1000;
int head[nmax];///指向左孩子
int next[nmax];///指向相邻兄弟
char cha[nmax];///节点字符
int val[nmax];///记录节点相同前缀个数
int N,sz;
long long ans;
void Insert(char * word)
{

    int len=strlen(word);
    int u=0,v;
    for(int i=0; i<=len; i++)
    {


        for(v=head[u]; v; v=next[v])
        {
            if(cha[v]==word[i])
                break;
        }
        if(!v)
        {
            v=sz++;
            val[v]=0;
            next[v]=head[u];
            head[u]=v;
            head[v]=0;
            cha[v]=word[i];
        }

        ans+=(long long)((val[u]-val[v])*(i*2+1));///一般情况
       // cout<<ans<<endl;
        val[u]++;
        u=v;
        if(i==len)
        {
            ans+=(long long)(val[v]*(i+1)*2);///完全相同的情况
            val[v]++;///要把'\0'也是算上
        }
    }

}
int main()
{
    char word[1003];
    int k=0;
    while(scanf("%d",&N)&&N){
        val[0]=0,head[0]=0,next[0]=0,ans=0,sz=1;
        for(int i=0;i<N;i++)
       {
           scanf("%s",word);
           Insert(word);
       }
     //  cout<<ans<<endl;
       printf("Case %d: %lld\n",++k,ans);

    }
    return 0;
}