魔咒词典
Time Limit: 8000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6773 Accepted Submission(s): 1703
给你一部魔咒词典。当哈利听到一个魔咒时,你的程序必须告诉他那个魔咒的功能;当哈利需要某个功能但不知道该用什么魔咒时,你的程序要替他找到相应的魔咒。如果他要的魔咒不在词典中,就输出“what?”
[魔咒] 对应功能
其中“魔咒”和“对应功能”分别为长度不超过20和80的字符串,字符串中保证不包含字符“[”和“]”,且“]”和后面的字符串之间有且仅有一个空格。词典最后一行以“@END@”结束,这一行不属于词典中的词条。
词典之后的一行包含正整数N(<=1000),随后是N个测试用例。每个测试用例占一行,或者给出“[魔咒]”,或者给出“对应功能”。
[expelliarmus] the disarming charm [rictusempra] send a jet of silver light to hit the enemy [tarantallegra] control the movement of one's legs [serpensortia] shoot a snake out of the end of one's wand [lumos] light the wand [obliviate] the memory charm [expecto patronum] send a Patronus to the dementors [accio] the summoning charm @END@ 4 [lumos] the summoning charm [arha] take me to the sky
light the wand accio what? what?
#include<stdio.h>
#include<string.h>
#include<cstdlib>
#include<map>
#include<iostream>
#include<string>
using namespace std;
int main(){
string gongneng,id,temp;
int n;
pair<string,string> q,p;
map<string,string> mp;
while(cin>>q.first){
if(q.first=="@END@") break;
getchar();
getline(cin,q.second);
p.first=q.second,p.second=q.first;
mp.insert(q);
mp.insert(p);
}
scanf("%d",&n);
getchar();
while(n--){
getline(cin,temp);
map<string,string>::iterator it=mp.find(temp);
if(it!=mp.end()){
if(it->second[0]=='['){
for(int i=1;i<it->second.size()-1;i++){
cout<<it->second[i];
}
cout<<endl;
}
else cout<<it->second<<endl;
}
else if(it==mp.end()){
cout<<"what?"<<endl;
}
}
return 0;
}