I've been trying to solve 1857G - Подсчет графов for a while and it seems that my solutions will invariably receive MLE. Is there any way to use less memory to solve these kinds of problems. Any help would be appreciated.
My solutions: 220733247
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
How to better utilize memory for minimum spanning trees problems?
I've been trying to solve 1857G - Подсчет графов for a while and it seems that my solutions will invariably receive MLE. Is there any way to use less memory to solve these kinds of problems. Any help would be appreciated.
My solutions: 220733247
Название |
---|