How can I calculate memory of a program to avoid MLE? Thanks!
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
How can I calculate memory of a program to avoid MLE? Thanks!
Name |
---|
To get an estimate you can check your array usage and STL container usage.
For array it will be memory of primitive type * array size, say int $$$x[1000][1000]$$$ uses $$$4 bytes * 1000 *1000 = 4MB$$$
For STL containers it will be a constant factor for that container * memory of primitive type * size + some constant (ignore as the first term will dominate) A ref here
In fact CF standard memory limit are so loose and you don't need to care at most cases. And the memory usage shown may differ < 1600KB from actual. I think you can forget those things and solve some problems first.
PS: In C/C++ a boolean takes 1 byte. If you want a boolean array with tight memory limit, use a char array and store 4 boolean in one char or use C++ bitset library. I remember there is such a question in contest in few years ago.