Recently when I was doing Universal Cup Round 5, I got stuck on A as I realised that my solution required way too much memory
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
[Idea] Using HLD to reduce memory
Recently when I was doing Universal Cup Round 5, I got stuck on A as I realised that my solution required way too much memory
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en10 |
![]() |
maomao90 | 2024-04-07 12:31:56 | 126 | Tiny change: '.\n\n[cut]\n\n# Opti' -> '.\n\n[cut] \n\n# Opti' | |
en9 |
![]() |
maomao90 | 2023-03-04 03:27:10 | 27 | Tiny change: '\n ' -> '\n sub[u] += sub[v];\n ' | |
en8 |
![]() |
maomao90 | 2023-03-03 13:23:19 | 23 | Tiny change: '\n ' -> '\n getSub(v, u);\n ' | |
en7 |
![]() |
maomao90 | 2023-03-03 09:50:46 | 21 | ||
en6 |
![]() |
maomao90 | 2023-03-03 09:32:29 | 36 | ||
en5 |
![]() |
maomao90 | 2023-03-03 07:51:24 | 1506 | (published) | |
en4 |
![]() |
maomao90 | 2023-03-03 07:12:35 | 132 | ||
en3 |
![]() |
maomao90 | 2023-03-03 07:11:07 | 3083 | Tiny change: 'uires $O(N|S|)$ memo' -> 'uires $O(N\cdot |S|)$ memo' | |
en2 |
![]() |
maomao90 | 2023-03-02 19:01:59 | 153 | ||
en1 |
![]() |
maomao90 | 2023-03-02 19:00:27 | 222 | Initial revision (saved to drafts) |
Name |
---|