• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            隨筆 - 6, 文章 - 0, 評論 - 24, 引用 - 0
            數據加載中……

            Trie在程序設計競賽中的應用

            Trie在程序設計競賽中的應用

            題目

             Message Flood
            Problem 

            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. 

            Sample Input
            5 3
            Inkfish
            Henry
            Carp
            Max
            Jericho
            Carp
            Max
            Carp
            0
            Sample Output
            3


            代碼

             1#include <iostream>
             2#include <string>
             3#include "trie.h"
             4
             5struct Index {
             6    int operator[](char ch) {
             7        if (isupper(ch)) return ch - 'A';
             8        return ch - 'a';
             9    }

            10}
            ;
            11
            12int n, m;
            13std::string name;
            14trie<26, Index> name_set;
            15
            16int main() {
            17    while (std::cin>>n>>&& n) {
            18        name_set.clear();
            19        for (int i = 0; i < n; ++i) {
            20            std::cin>>name;
            21            name_set.insert(name.begin(), name.end());
            22        }

            23        int count = 0;
            24        while (m--{
            25            std::cin>>name;
            26            count += name_set.erase(name.begin(), name.end());
            27        }

            28        printf("%d\n", n - count);
            29    }

            30}

            31


            測試數據

            輸入數據
            輸出數據

            參考資料
            郭嵩山、張子臻、王磊、湯振東著  國際大學生程序設計競賽例題解(五)  電子工業出版社

            posted on 2009-03-28 11:45 yuyang7 閱讀(1713) 評論(0)  編輯 收藏 引用 所屬分類: 程序設計競賽

            2021久久国自产拍精品| 99精品国产免费久久久久久下载| 热re99久久精品国产99热| 国产成人精品久久一区二区三区av | 91精品国产综合久久婷婷| 国内精品久久国产大陆| 无码精品久久一区二区三区| 日日躁夜夜躁狠狠久久AV| 2020最新久久久视精品爱 | 少妇久久久久久被弄到高潮 | AAA级久久久精品无码区| 久久香蕉国产线看观看猫咪?v| 国产成人精品综合久久久久| 久久综合九色综合久99| 久久久一本精品99久久精品88 | 亚洲精品美女久久久久99小说| 天天综合久久久网| 久久久久波多野结衣高潮| 中文字幕久久精品| 999久久久免费国产精品播放| 97精品依人久久久大香线蕉97 | 久久精品无码一区二区三区免费| 欧美亚洲另类久久综合| 亚洲欧美日韩中文久久| 中文字幕日本人妻久久久免费| 国内精品免费久久影院| 51久久夜色精品国产| 久久婷婷激情综合色综合俺也去| 亚洲日本久久久午夜精品| 日本国产精品久久| 日本精品久久久久中文字幕| 精品无码久久久久久尤物| 99精品久久久久中文字幕| 亚洲午夜久久久久久久久电影网 | 亚洲国产天堂久久综合网站| 久久精品黄AA片一区二区三区| 久久久国产打桩机| 亚洲中文久久精品无码| 青草国产精品久久久久久| 狠狠色婷婷久久综合频道日韩| 国产99久久久国产精品小说|