cses graph problem for labyrinth

help
,
1

Getting a TLE in test case 13 , on the labyrinth problem could anyone can help in this regard
My approach to the problem was to find shortest path using bfs it took me long enough to implement this please help in this regards
link: https://ideone.com/zaVKcB

Screenshot 2021-09-20 141207
Screenshot 2021-09-20 141207777×547 33.3 KB

2

Link is not working for me.

3

bro your link is not working

4

please check now

5

please check

6

Try long long
if it doesn’t work

try declaring global variables/containers in the function .

7

I tried didn’t worked

8

@vijju123 please help in this problem

9 
if(x1-1==px){
        ans="D"+ans;
        x1=x1-1;
    }
    else if(x1+1==px){
         ans="U"+ans;
         x1=x1+1;
    }
    else if(y1-1==py) {
        ans="R"+ans;
        y1=y1-1;
    }
    else if(y1+1==py) {
        ans="L"+ans;
        y1=y1+1;
    }

Your implementation is pretty much inefficient.

You have another choice - rewrite it as
ans += "some_character", reverse the string at the end and print it.

Or you can print the characters one by one in the loop itself.

10

Thanks bro