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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
[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 |
---|