-
Notifications
You must be signed in to change notification settings - Fork 0
/
funfair.cpp
60 lines (48 loc) · 1.19 KB
/
funfair.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
#include <bits/stdc++.h>
#define ii pair<int,int>
using namespace std;
map<int,int> m;
int least_charge(vector<int>& times, int minIndex) {
if (m.find(minIndex) != m.end()) {
return m[minIndex];
}
if (minIndex >= times.size()) {
return 0;
}
int result = INT_MAX;
int currentTime = times[minIndex];
int newIndex = minIndex+1;
while (newIndex < times.size() && times[newIndex] - currentTime < 24*60) {
newIndex++;
}
result = min(result, 50 + least_charge(times, newIndex));
newIndex = minIndex+1;
while (newIndex < times.size() && times[newIndex] - currentTime < 6*60) {
newIndex++;
}
result = min(result, 20 + least_charge(times, newIndex));
newIndex = minIndex+1;
while (newIndex < times.size() && times[newIndex] - currentTime < 60) {
newIndex++;
}
result = min(result, 5 + least_charge(times, newIndex));
result = min(result, 2 + least_charge(times, minIndex+1));
m[minIndex] = result;
return result;
}
int main() {
int N;
cin >> N;
int total = 0;
vector<int> times;
int prev = 0;
for (int i = 0; i < N; i++) {
m.clear();
int num;
cin>>num;
times.push_back(num);
int least = least_charge(times, 0);
cout << (least - prev) << endl;
prev = least;
}
}