-
Notifications
You must be signed in to change notification settings - Fork 5
/
GFG_CircularTourOfPetrolPumps.cpp
107 lines (87 loc) · 1.98 KB
/
GFG_CircularTourOfPetrolPumps.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
/*
https://practice.geeksforgeeks.org/problems/circular-tour-1587115620/1#
Circular tour
*/
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
struct petrolPump
{
int petrol;
int distance;
};
// } Driver Code Ends
/*
The structure of petrolPump is
struct petrolPump
{
int petrol;
int distance;
};*/
/*You are required to complete this method*/
class Solution{
public:
//Function to find starting point where the truck can start to get through
//the complete circle without exhausting its petrol in between.
int tour(petrolPump p[],int n)
{
int index = 0;
int deficit = 0;
int balance = 0;
for(int i=0; i<n; i++)
{
balance += p[i].petrol - p[i].distance;
if(balance < 0) //balance negative to deficit
{
deficit += balance;
index = i+1;
balance = 0;
}
}//end
if(deficit + balance >=0)
return index;
return -1;
}//end
//greedy approach
int tour_(petrolPump p[],int n)
{
int index = -1, diff=0;
int sumPetrol = 0, sumDistance = 0;
for(int i=0; i<n; i++)
{
sumPetrol += p[i].petrol;
sumDistance += p[i].distance;
}
if(sumPetrol < sumDistance)
return -1;
for(int i=0; i<n; i++)
{
if(index == -1)
index = i;
diff += p[i].petrol - p[i].distance;
if(diff < 0)
{
index = -1;
diff = 0;
}
}//
return index;
}
};
// { Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
petrolPump p[n];
for(int i=0;i<n;i++)
cin>>p[i].petrol>>p[i].distance;
Solution obj;
cout<<obj.tour(p,n)<<endl;
}
}
// } Driver Code Ends