1 #include <iostream>
 2 #include <cstdio>
 3 #include <set>
 4 #include <unordered_set>
 5 #include <unordered_map>
 6 using namespace std;
 7 
 8 struct Node {
 9     Node() {}
10     Node(int _x, int _y):x(_x), y(_y) {}
11     int x, y;
12     bool operator == (const Node &t) const {
13         return  x==t.x && y==t.y;
14     }
15 };
16 struct NodeHash {
17     std::size_t operator () (const Node &t) const {
18         return  t.x * 100 + t.y;
19     }
20 };
21 unordered_set <Node, NodeHash> h_set;
22 unordered_map <Node, string, NodeHash> h_map;
23 
24 int main()
25 {
26     h_set.insert(Node(1, 2));
27     int x, y;
28     cin >> x >> y;
29     if(h_set.find(Node(x, y)) == h_set.end()) {
30         cout << "Not found" << endl;
31     }
32     else  cout << "Found succeed" << endl;
33     h_map[Node(1, 2)] = "World";
34     cout << h_map[Node(1, 2)] << endl;
35     return 0;
36 }
37 
38 /*
39 
40 输入： 1 2
41 
42 输出：
43 
44 1 2
45 Found succeed
46 World
47 
48 */