1#include <vector>
2#include <list>
3using namespace std;
4
5class MyHashMap {
6private:
7    static const int size = 1000;
8    vector<list<pair<int, int>>> map;
9
10    int hash(int key) {
11        return key % size;
12    }
13
14public:
15    MyHashMap() {
16        map.resize(size);
17    }
18
19    void put(int key, int value) {
20        int idx = hash(key);
21        for (auto &it : map[idx]) {
22            if (it.first == key) {
23                it.second = value;
24                return;
25            }
26        }
27        map[idx].emplace_back(key, value);
28    }
29
30    int get(int key) {
31        int idx = hash(key);
32        for (const auto &it : map[idx]) {
33            if (it.first == key) {
34                return it.second;
35            }
36        }
37        return -1;
38    }
39
40    void remove(int key) {
41        int idx = hash(key);
42        map[idx].remove_if([key](const pair<int, int> &it) { return it.first == key; });
43    }
44};

1class