I am getting TLE in this CSES problem.
My Approach
Problem
Can anyone please tell me why it is showing TLE?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
I am getting TLE in this CSES problem.
I have used Floyd Cycle Detection Algorithm
to find out the size of the cycle.
Now the answer for all the nodes which are a part of the cycle is the size of cycle
.
And for the other nodes, ans is = size_of_cycle + minimum_distance_of_a_node_which_is_a_part_of_cycle
.
This approach passed all the test cases except 4 (in which it is showing TLE). Here is the link to the code Code I think the time complexity of my solution is $$$O(N)$$$.
Can anyone please tell me why it is showing TLE?
Name |
---|
Your approach is correct, maybe the problem is your implementation, Can you share it?
Code
loop will run forever if there is no cycle
KrisjanisP Can you please help?