# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
Hello CodeForces, today I tried solving the problem from a recent contest: 1923E - Count Paths
My Solution:
Use centroid decomposition to count the paths, for a given centroid, we keep track of the nodes we see first with a certain color and count the paths accordingly. Because colors go from 1 to N, we can use array instead of map. So I figured the time complexity would be O(N lg N). But the solution TLE's.
If you see any problems with the code, please let me know as I can't see the problem. If you don't understand a part of the code, please ask and I will clarify.
Submission: 255437477
UPD: The runtime takes more than 30 seconds! So I guess the runtime is O(N^2) somehow.
Name |
---|