hdu 1894 String Compare（快速排序）

String Compare

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1931    Accepted Submission(s): 472

Problem Description

Maybe there are 750,000 words in English and some words are prefix of other words, for example: the word "acm" can be treat as one prefix of "acmicpc". What's more, most of such pairs of words have relationship between them. Now give you a dictionary, your work is to tell me how many such pairs. 


There may be other characters in the word, for example '_','-',and so on. 
Pay attention that 'A' and 'a' are not the same character! 

 

 

Input

In the first line of the input file there is an Integer T, which means the number of test cases. Followed by T test cases. 
For each test case, in the first line there is an integer N(0<N<=50000), followed N lines, each contains a word whose length is less than 30 and no space appears in any word. There are no same words in two different lines. 

 

 

Output

For each test case, tell me how many such pairs. If the number is larger than 11519, just divide it by 11519 and only output the remainder. 

 

 

Sample Input

2

2

acmicpc

acm

3

a

abc

ab

 

 

Sample Output

1

3

 

如果是用C++的sort快排，要用

return strcmp(a1.a,b1.a)<0;

  如果用C的qsort排序，要用

return strcmp(a1.a,b1.a);

 1 # include<stdio.h>
 2 # include<string.h>
 3 # include<stdlib.h>
 4 #include<iostream>
 5 #include<algorithm>
 6 using namespace std;
 7 # define inf  11519
 8 struct node{
 9     char a[50];
10 }s[50005];
11 bool cmp(node a1,node b1)
12 {
13     return strcmp(a1.a,b1.a)<0;
14 }
15 int main()
16 {
17     int T,ans,n,i,j,k,len;
18     scanf("%d",&T);
19     while(T--)
20     {
21         scanf("%d",&n);
22         for(i=0;i<n;i++) scanf("%s",s[i].a);
23         sort(s,s+n,cmp);
24         ans=0;
25         for(i=0;i<n-1;i++)
26         {
27             len = strlen(s[i].a);
28             for(j=i+1;j<n;j++)
29             {        
30                 for(k=0;k<len;k++)
31                 {
32                     if(s[i].a[k]==s[j].a[k]);
33                     else break;
34                 }
35                 if(k<len) break;
36                 else ans++;
37             }
38         }
39         if(ans>inf) ans=ans%inf;
40         printf("%d\n",ans);
41     }
42     return 0;
43 }