hdoj--1075 What Are You Talking About(Trie or map)

hdoj 1075

题解

map，或者，字典树。

#include <iostream>
#include <map>
#include <string>
#include <cctype>
#include <cstdio>
#include <cstring>
using namespace std;

//889MS  73424K
map<string, string> mp;

int main()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif // LOCAL
    ios::sync_with_stdio(0);
    cin.tie(0);

    string s, e;
    cin >> s;
    while(cin >> s && s != "END"){
        cin >> e;
        mp[e] = s;
    }

    cin >> s;
    cin.ignore();
    while(getline(cin, s) && s != "END"){
        string tmp;
        for(int i = 0; i < (int)s.length(); ++i){
            if(islower(s[i])){
                tmp += s[i];
                continue;
            }
            cout << (mp.count(tmp) ? mp[tmp] : tmp);
            tmp = "";
            cout << s[i];
        }
        cout << endl;
    }
    return 0;
}

Trie

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

//g++ 468MS 128516K
//c++ 686MS 65164K
struct Trie
{
    Trie* next[26];
    string word;
    Trie():word(""){ memset(next, 0, sizeof(next)); }
};

void Insert(Trie* root, string& s, string& e)
{
    Trie* p = root;
    for(int i = 0; i < (int)e.length(); ++i)
    {
        int id = e[i] - 'a';
        if(p->next[id] == NULL) p->next[id] = new Trie;
        p = p->next[id];
    }
    p->word = s;
}

string Search(Trie* root, string& s)
{
    Trie* p = root;
    int   i;
    for(i = 0; i < (int)s.length(); ++i)
    {
        int id = s[i] - 'a';
        p = p->next[id];
        if(!p) return "";
    }
    return p->word;
}

int main()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif // LOCAL
    ios::sync_with_stdio(0);
    cin.tie(0);

    Trie* root = new Trie;
    string s, e;

    cin >> s;
    while(cin >> s && s != "END"){
        cin >> e;
        Insert(root, s, e);
    }
    cin >> s;
    cin.ignore();
    while(getline(cin, s) && s != "END"){
        string tmp;
        for(int i = 0; i < (int)s.length(); ++i){
            if(islower(s[i])){
                tmp += s[i];
                continue;
            }
            string res = Search(root, tmp);
            cout << (res != "" ? res : tmp);
            tmp = "";
            cout << s[i];
        }
        cout << endl;
    }
    return 0;
}