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 | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
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?