sicily 1194. Message Flood

Description

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 messages 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 messages, 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.

Input

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.

Output

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

暴力搜索肯定是不能滴……只要快排+二分就能过了

同样不给用qsort，又要自己写快排= = 歧视写C的嘛！为啥sort就行qsort就不给用……

貌似用C++的话可以用各种容器搞定，等学了再回头来看看

AC runtime 0.06s

#include <stdio.h>
#include <string.h>
char fri[20000][11];
char sent[20000][11];

void strUpr( 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 biSrch( int m, char str[] )
{
    int start = 0, end = m - 1;
    int mid;
    
    while (start <= end)
    {
        mid = ( start + end ) / 2;
 
        if ( strcmp( str, sent[mid] ) == 0 )
            return 1;
        else if ( strcmp( str, sent[mid] ) == -1 )
            end = mid - 1;
        else
            start = mid + 1;
    }
    
    return 0;
}

void quick( int l, int r )
{
    int i, j;
    char x[11];
    
    if ( l >= r )
        return;
    
    i = l;
    j = r;
    strcpy( x, sent[i] );
    
    while( i < j )
    {
        while ( i < j && strcmp( sent[j], x ) == 1 )
            j--;
        if ( i < j )
            strcpy( sent[i++], sent[j] );
        
        while ( i < j && strcmp( sent[i], x ) == -1 )
            i++;
        if ( i < j )
            strcpy( sent[j--], sent[i] );
    }
    
    strcpy( sent[i], x );
    quick( l, i - 1);
    quick( i + 1, r);
}


int main()
{
    int i, m, n, count;
    
    while( scanf("%d", &n) && n != 0 )
    {
        scanf("%d", &m);
        count = 0;
        for( i = 0; i < n; i++ )
        {
            scanf("%s", fri[i]);
            strUpr(fri[i]);
        }
            
        
        for ( i = 0; i < m; i++ )
        {
            scanf("%s", sent[i]);
            strUpr(sent[i]);
        }
        
        quick( 0, m - 1 );
        
        for ( i = 0; i < n; i++ )
        {
            if ( biSrch ( m, fri[i] ) )
                count++;
        }
        
        printf("%d\n", n - count);
    }

    return 0;
}