SDUT 1500 Message Flood （快排+二分查找）

题目描述

Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and benefits people a lot". However, If you ask Merlin this question on the New Year's Eve, he will definitely answer "What a trouble! I have to keep my fingers moving on the phone the whole night, because I have so many greeting message to send!" Yes, Merlin has such a long name list of his friends, and he would like to send a greeting message to each of them. What's worse, Merlin has another long name list of senders that have sent message to him, and he doesn't want to send another message to bother them Merlin is so polite that he always replies each message he receives immediately). So, before he begins to send message, he needs to figure to how many friends are left to be sent. Please write a program to help him. Here is something that you should note. First, Merlin's friend list is not ordered, and each name is alphabetic strings and case insensitive. These names are guaranteed to be not duplicated. Second, some senders may send more than one message to Merlin, therefore the sender list may be duplicated. Third, Merlin is known by so many people, that's why some message senders are even not included in his friend list.

输入

There are multiple test cases. In each case, at the first line there are two numbers n and m (1<=n,m<=20000), which is the number of friends and the number of messages he has received. And then there are n lines of alphabetic strings(the length of each will be less than 10), indicating the names of Merlin's friends, one per line. After that there are m lines of alphabetic strings, which are the names of message senders. The input is terminated by n=0.

输出

For each case, print one integer in one line which indicates the number of left friends he must send.

示例输入

5 3
Inkfish
Henry
Carp
Max
Jericho
Carp
Max
Carp
0

示例输出

3

大体题意：输入两个数N和M，前M行是M个字符串str1,后边的N行是N个字符串str2,要求是找出str1中有多少个和str2不同的字符串

思路：应该用哈希，本人用了快排+二分查找，时间较长，也能AC。还有一个问题，就是本题不区分大小写，好坑爹的，输入的字符串应该先全部转化为大写或小写。

对m个字符串排序（快排，还是第一次用快排对字符串排序，好头疼），然后循环n个字符串，一个一个的在M个字符串中查找，最后用N减去相同的个数就可以了。

上代码：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

char str1[20000][11],str2[20000][11];

void quick(int l , int r)  //快排
{
    char x[11];
    int i=l,j=r;
    strcpy(x,str2[l]);

    if(l>=r) return ;

    while(i<j)
    {
        while(i<j && strcmp(str2[j],x)>=0) j--;
            strcpy(str2[i],str2[j]);
        while(i<j && strcmp(str2[i],x)<=0) i++;
            strcpy(str2[j],str2[i]);
    }

    strcpy(str2[i],x);
   quick(l,i-1);
   quick(i+1,r);

}

int search(int s , int t , char *key) //二分查找（表示全部看课本照葫芦画瓢)
{
    int low=s,high=t,mid;
    if(s<=t)
    {
        mid=low+(high-low)/2;
        if(strcmp(str2[mid],key)==0)
            return 1;
        else if(strcmp(str2[mid],key)>0)
            return search(low,mid-1,key);
        else if(strcmp(str2[mid],key)<0)
            return search(mid+1,high,key);
    }

    return 0;
}

void strup( char *str )  //转换大小写（我全部转换成了大写）
{
    int i, len = strlen(str);

    for ( i = 0; i < len; i++ )
    {
        if( str[i] <= 'z' && str[i] >= 'a' )
            str[i] = str[i] - 'a' + 'A';
    }
}


int main()
{

    int n,m,count;
    int i;

    while(~scanf("%d",&n)&&n)
    {
        scanf("%d",&m);
        count=0;

        for(i=0;i<n;i++)
        {
            scanf("%s",str1[i]);
            strup(str1[i]);
        }

        for(i=0;i<m;i++)
        {
            scanf("%s",str2[i]);
            strup(str2[i]);
        }

        quick(0,m-1);  //对m个字符串快排

        for(i=0;i<n;i++)
        {
            if(search(0,m-1,str1[i]))  //在m个字符串str2中挨个查找str1
                count++;  //查找到的相同的个数
        }

        printf("%d\n",n-count);  
    }
    return 0;
}