forked from IElgohary/Uva-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
11935 - Through the desert.cpp
114 lines (92 loc) · 2.41 KB
/
11935 - Through the desert.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
108
109
110
111
112
113
114
/*input
0 Fuel consumption 10
50 Gas station
50 Fuel consumption 20
100 Goal
0 Fuel consumption 20
50 Gas station
50 Fuel consumption 10
100 Goal
*/
#include <stdio.h>
#include <cmath>
#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string.h>
#include <cstring>
#include <stack>
#include <map>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <functional>
#include <bitset>
using namespace std;
#define r(input) freopen("input.txt","r",stdin)
#define w(output) freopen("output.txt","w",stdout)
#define FOR(i, a) for ( int i = 0 ; i < a ; i++ )
#define FOREACH(l) for (auto it = l.begin(); it != l.end(); it++)
#define BitCount(i) __builtin_popcount(i)
#define Sort(v) sort(v.begin(),v.end())
#define cover(a, d) memset(a,d,sizeof(a))
#define remove(v,e) v.erase(std::find(v.begin(),v.end(),e))
#define is_in(container, element) (container.find(element) != container.end())
#define SWAP(a,b) a= a^b, b=a^b, a=a^b
#define sz size
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define VISITED 1
#define UNVISITED 0
#define INF 1000000000
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef pair<int,ii> triple;
inline int toint(string s){int v; istringstream sin(s);sin>>v;return v;}
inline ll toll(string s){ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
template<class T> inline char toChar(T x) { ostringstream sout; sout << x; return sout.str()[0];}
class Compare
{
public:
bool operator() (ii t1 , ii t2){
return t1>t2;
}
};
int main()
{
string line;
while (getline(cin, line))
{
if(line == "0 Fuel consumption 0")break;
double curr = 0.0, tank = 0.0;
int dist = 0, consumption = 0, leak = 0;;
do
{
istringstream sin(line);
int n , c;
string s,trash;
sin >> n >> s;
if(s == "Fuel" || s == "Gas") sin>>trash;
sin >> c;
curr += leak * (n-dist);
curr += (consumption/100.0) * (n - dist);
tank = max(curr, tank);
//cout << dist << " "<< tank<<" " <<n<< endl;
if ( s == "Goal") break;
if ( s == "Fuel") consumption = c;
else if ( s == "Leak") leak++;
else if (s[0] == 'M') leak = 0;
else if (s == "Gas") curr = 0.0;
dist = n;
}while(getline(cin, line));
cout << fixed << setprecision(3) << tank<< endl;
}
}