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 | 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 | 158 |
| 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 |
[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 |
|---|


