| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 1 | maomao90 | 161 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | TheScrasse | 142 |
Today I used two maps like that
map<pair<char,int>,int>mp1;
map<pair<char,int>,int>mp2;
It leaded to MLE-Memory Limit exceeded.
I guess some solutions with like this below got accepted-
map<int,vector<int>>mp1
map<int,vector<int>>mp2;
Then a question comes to my mind is there some anticpated benchmarks for using maps.How less complex it should be to avoid MLE?Is there some suggestions?
Auto comment: topic has been updated by I_lOVE_ROMAN (previous revision, new revision, compare).
Auto comment: topic has been updated by I_lOVE_ROMAN (previous revision, new revision, compare).
Auto comment: topic has been updated by I_lOVE_ROMAN (previous revision, new revision, compare).
You may assume
map<T, F>has a size of(sizeof(T) + sizeof(F)) * number of keys. To avoid MLEs, use other data structures, which are most likely to be more efficient, since usingmap<int, vector<int>>is very impractical.The data structure map is using is red black tree. There's also the left and right child,the parent pointers and the colour of the node.