SHROUTE - problem (june long)

help
, ,
1

Question link - CodeChef: Practical coding for everyone
solution link -CodeChef: Practical coding for everyone

It is giving WA
What is wrong in this cannot understand. All sample test cases passed.

I HAVE MADE ARRAYS FOR COUNTING DISTANCE FROM WHERE 1 COMES, AND WHERE 2 COMES. IT IS AN EASIEST APPROACH.

2

I couldn’t see where you enforce that destination of city 1 is always achieved at time zero, whatever trains are available, in fact even with no trains.

1 Like
3

I have made one[] array to store the distance if 1 comes. similarly with two[] array. Can you provide some test cases that is not working. It would be great.

4

Exactly as @joffan says; consider the test input:

1                    
1 1
0
1
2 Likes
6

Now, this test case also works, any other test case that doesn’t work?
New_Solution - CodeChef: Practical coding for everyone

1 Like
7

Spacing issues in your output; consider the following test input:

1
3 3
1 1 1
2 1 2
1 Like
8

Finally, got CA, Thank you so so much🤩. Had tried almost 15-20 tries from last 10 days… finally got CA.

1 Like