I'm stuck on a problem regarding a circular tour in GeeksforGeeks. Any help would be appreciative.

I can't seem to figure out the problem on GeeksforGeeks. The problem is as follows: Petrol Pump Difficulty Level : Hard Last Updated : 23 Oct, 2022 There are N petrol pumps in a circular manner, where the amount of petrol in each petrol pump is more than 0. You have two cars. car1 covers the clockwise direction and car2 covers the anti-clockwise direction. Your task if to complete the round from both the cars starting from the petrol pump 1. The petrol pump has petrol in the clockwise and anti-clockwise directions. Your task if to complete the round from both the cars starting from the petrol pump 1. Completion of the round means that the petrol at any point of time should be greater than 0. Input Format The first line of the standard input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the number of petrol pumps. Then the next N lines follow . In each line two space separated values are given denoting the amount of petrol and the distance between petrol pump. Output Format If both the cars can make a round print "Both\n" otherwise print "Car1\n" if only car1 is able to complete the round or "Car2\n" if only car2 is able to complete a round. Your Task You just have to write the code that will tell if both the cars are able to complete the round or car1 or only car2 is able to complete the round. You need to complete the function ***func***. Constraint 1. 1 <= T <= 1000 2. 1 <= N <= 1000 3. 1 <= Petrol, Distance <= 1000 Subtask 1 1. 1 <= T <= 100 2. 1 <= N <= 100 3. 1 <= Petrol, Distance <= 1000 Subtask 2 1. 1 <= T <= 1000 2. 1 <= N <= 1000 3. 1 <= Petrol, Distance <= 1000 Example Sample Input 1 4 100 5 50 100 50 8 100 2 Sample Output Car1 Explanation We require a min 2 litre of petrol to go to next pump so we have 98 litre of petrol left which we save it. Then we require a min 98 litre of petrol to go next pump but we dont have that much petrol available so it means that we can only go next pump from this point only so we will start the car2 from the next pump and rest of journey can be completed by car1. So the output is Car1. Note:- In the examples if we would choose the car2 in place of car1 then also we will get the same answer Car2. Note:- Also in the examples if we would choose the car2 in place of car1 then also we will get the same result Car2. So to avoid the same answer will be printed again and again we will only print the car1. So the output is Car1. Note:- In the examples if we would choose the car2 in place of car1 then also we will get the same answer Car2. Note:- Also in the examples if we would choose the car2 in place of car1 then also we will get the same result Car2. So to avoid the same answer will be printed again and again we will only print the car1. Sample Input 1 7 1000 15 200 90 300 10 1000 50 1000 100 10 900 100 20 Sample Output Both Explanation Both the cars are able to complete the round so we will print Both. Sample Input 1 8 100 5 50 150 50 8 100 15 100 50 1000 100 10 900 100 20 Sample Output Car2 Explanation If both the cars cannot complete the round then only car2 can complete the round so the output is Car2. Sample Input 1 3 40 10 10 50 40 10 Sample Output Car2 Explanation If both the cars cannot complete the round then only car2 can complete the round so the output is Car2. So I tried the following code. But it doesn't work for all test cases. ``` def func(n,arr): forward_start=-1 backward_start=-1 for i in range(n): if arr[i][0]-arr[i][1]>=0: forward_start=i break for i in range(n-1,0,-1): if arr[i][0]-arr[i][1]>=0: backward_start=i break if forward_start==-1 or backward_start==-1: return "None" start_index=backward_start+1 end_index=forward_start-1 forward_count=0 backward_count=0 for i in range(start_index,end_index+1): if arr[i][0]-arr[i][1]>=0: forward_count+=1 else: forward_count-=1 if arr[i][1]-arr[i][0]>=0: backward_count+=1 else: backward_count-=1 if forward_count>=0 and backward_count>=0: return "Both" else: return "None" t=int(input()) for _ in range(t): n=int(input()) arr=[] for i in range(n): arr.append(list(map(int,input().split()))) print(func(n,arr)) ``` Any help would be greatly appreciated!

I'm stuck on a problem regarding a circular tour in GeeksforGeeks. Any help would be appreciative.

Comments (1) 824 👁️