| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
|
0
Auto comment: topic has been updated by Polyn0mial (previous revision, new revision, compare). |
|
0
Auto comment: topic has been updated by Polyn0mial (previous revision, new revision, compare). |
|
0
It worked! Finally! Thank you for your help! |
|
0
Not sure how. If we only do the middle ones, what will be the final answer? Some of the $$$\text{full_mask}$$$ could be starting from some nodes that isn't directly connected to node $$$1$$$. |
|
0
Sorting is only $$$O(N \cdot 2^N)$$$ which is way smaller than $$$O(2^N \cdot N^2)$$$. Also, only do dp on the middle nodes like this $$$dp[\text{first_node}][\text{visited_nodes}][\text{ending_node}]$$$ ? However it requires $$$O(2^N \cdot N^2)$$$ memory which is too much. |
|
0
Is it because bottom-up approach checked to many unimportant states? |
|
0
Auto comment: topic has been updated by Polyn0mial (previous revision, new revision, compare). |
|
+3
Thank you! I somehow thought that I'm doing prefix sums on mobius and use int instead of long long since mobius only has -1, 0, 1 and won't overflow. |
|
+3
That make sense. Thanks for pointing that out! |
|
0
Thanks! That's exactly what I'm missing. |
|
0
In the editorial of problem G, "If Vertex 0 has other vertices, and if the next smallest vertex is Vertex $$$A_k$$$, then Vertices are descendants of $$$A_l$$$, in which there are $$$dp[l+1][k]$$$ ways to do so; on the other hand, there are $$$dp[k][r]$$$ possible trees as a result of removing Vertex $$$A_l$$$ and its descendants." What does "next smallest vertex" means? Also I don't understand the part $$$dp[l + 1][k] * dp[k][r]$$$. Isn't it suppose to be $$$dp[l + 1][k] * dp[k][r]$$$? |
|
On
maroonrk →
Daiwa Securities Co. Ltd. Programming Contest 2022 Spring(AtCoder Regular Contest 138)Announcement, 4 years ago
0
I have hard time understanding the editorial for problem B. Can somebody explain? |
|
+3
It is strange that stress test didn't find this bug. My stress test command |
|
+8
Thanks. That's a stupid mistake made by me. It worked. |
| Name |
|---|


