题目链接:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_C
题目如下:
Search - Dictionary
Time Limit : 2 sec, Memory Limit : 131072 KB
Search III
Your task is to write a program of a simple dictionary which implements the following instructions:
insert str: insert a string str in to the dictionary
find str: if the distionary contains str, then print ‘yes’, otherwise print ‘no’
Input
In the first line n, the number of instructions is given. In the following n lines, n instructions are given in the above mentioned format.
Output
Print yes or no for each find instruction in a line.
Constraints
A string consists of ‘A’, ‘C’, ‘G’, or ‘T’
1 ≤ length of a string ≤ 12
n ≤ 1000000
Sample Input 1
5
insert A
insert T
insert C
find G
find A
Sample Output 1
no
yes
Sample Input 2
13
insert AAA
insert AAC
insert AGA
insert AGG
insert TTT
find AAA
find CCC
find CCC
insert CCC
find CCC
insert T
find TTT
find T
Sample Output 2
yes
no
no
yes
yes
yes
代码如下:
#include <iostream>
#include <map>
#include <algorithm>
#include <cstring>
using namespace std;
int main(){
ios::sync_with_stdio(false);
map<string,int> mp;
int n;
cin>>n;
char ord[20],str[20];
for(int i=0;i<n;i++){
cin>>ord;
if(ord[0]=='i'){
cin>>str;
mp.insert(make_pair(str,1));
}
else{
cin>>str;
if(mp.count(str)) cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
return 0;
}