How can I calculate memory of a program to avoid MLE? Thanks!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
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.