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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
[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 |
|---|


