• <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)  編輯 收藏 引用 所屬分類: 程序設計競賽

            久久成人国产精品二三区| 99精品久久精品| 亚洲午夜久久久| 久久国产免费直播| 国内精品人妻无码久久久影院| 精品人妻久久久久久888| 久久久久国产日韩精品网站| 久久无码高潮喷水| 国产精品青草久久久久婷婷| 久久久久久av无码免费看大片| 久久久国产亚洲精品| 99久久精品国产一区二区蜜芽| 亚洲午夜福利精品久久| 51久久夜色精品国产| 久久精品国产亚洲AV久| 99精品久久久久久久婷婷| 亚洲国产精品一区二区久久hs | 久久精品成人| 久久久久亚洲AV成人片| 亚洲国产精品嫩草影院久久| 久久综合九色综合97_久久久| 99久久夜色精品国产网站| 久久久久九九精品影院| 99久久免费国产精品| 国内精品九九久久久精品| 久久WWW免费人成一看片| 伊人久久大香线蕉无码麻豆| 亚洲国产成人久久综合一| 99久久99这里只有免费费精品| 久久精品国产清自在天天线 | 久久久久AV综合网成人| 久久91精品国产91久| 综合久久给合久久狠狠狠97色| 久久久青草青青国产亚洲免观| 青青热久久综合网伊人| 99热成人精品免费久久| 国产一区二区精品久久岳| 国产毛片久久久久久国产毛片| 成人午夜精品久久久久久久小说| 久久精品免费一区二区三区| 久久亚洲欧美日本精品|