HNU 12888 Encryption（map容器）

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<map>
 6 #include<string>
 7 using namespace std;
 8 #define maxn 1005
 9 string str[maxn];
10 string dic[maxn][2];
11 map<string,string> map1;
12 pair<map<string,string>::iterator,bool> iter;
13 int main()
14 {
15     int T,n;
16     cin>>T;
17     while(T--)
18     {
19         cin>>n;
20         for(int i = 1;i <= n;++i)
21         cin>>str[i];
22         for(int i = 1;i <= n;++i)
23         cin>>dic[i][0];
24         for(int i = 1;i <= n;++i)
25         cin>>dic[i][1];
26         map1.clear();
27         for(int i = 1;i <= n;++i)
28         map1.insert(pair<string,string> (dic[i][0],dic[i][1]));
29         for(int i = 1;i <= n;++i)
30         {
31             if(i == n) cout<<map1[str[i]]<<endl;
32             else cout<<map1[str[i]]<<" ";
33         }
34     }
35     return 0;
36 }