T - stl 的mapⅡ

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了T - stl 的mapⅡ相关的知识,希望对你有一定的参考价值。

Description

Ignatius is so lucky that he met a Martian yesterday. But he didn‘t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?        
                

Input

The problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian‘s language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian‘s language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can‘t find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(‘ ‘), tab(‘\t‘), enter(‘\n‘) and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that‘s also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.        
                

Output

In this problem, you have to output the translation of the history book.        
                

Sample Input

START
from
fiwo hello
difh mars
riwosf earth
fnnvk like
fiiwj
END
START
difh, i‘m fiwo riwosf.
i fiiwj fnnvk! END
                

Sample Output

hello, i‘m from mars.
i like earth!

Hint

 Huge input, scanf is recommended. 



map存储字符数组比较麻烦
所以用map存储string 两个string一一对应 只能用cin输入
#include<iostream>
#include<stdio.h>
#include<string>
#include<string.h>
#include <map>
using namespace std;
int main() 
{
    map<string,string>mapDic;
    string a,b,c;
    cin>>c;
    while(cin>>a&&a!="END"){
        cin>>b; 
        mapDic[b]=a;
    }
    cin>>c;
    getchar();
    char s[3005];
     while(1){
         gets(s);
         if(strcmp(s,"END")==0)break;
         int n=strlen(s);
         b="\0";
         for(int i=0;i<n;i++){
             if(s[i]>=a&&s[i]<=z)b+=s[i];               //s[i]是字母,就将其存入string b中 
              else{                                      //若是s[i]不为字母
                 if(mapDic[b]!="\0")cout<<mapDic[b];      //就判断b是否可以用map转化地球语言  可以得话输出地球语言
                 else cout<<b;                             //不可以直接输出b
                 b="\0";                                      //清零b
                 printf("%c",s[i]);                           //不为字母 输出字符s[i]
              }                                   
         }
         printf("\n");
     }
    //system("pause");
    return 0;
}

 

 




以上是关于T - stl 的mapⅡ的主要内容,如果未能解决你的问题,请参考以下文章

STL---map

CodeForces 1000A Codehorses T-shirts(STL map思维)

访问了STL的MAP中没有的元素会出现啥情况啊?

如何禁止STL map 自动排序

cpp►STL容器->排序容器->map

C++ - 通过引用模板函数传递 STL 映射