-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathzombie_monitoring.py
57 lines (45 loc) · 2.25 KB
/
zombie_monitoring.py
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
def answer(intervals):
''' Produce the total time that is covered by at least one interval
in a list of intervals.
The intervals are (start, end) pairs where start < end.
'''
# sorting the list uncovers redundancy
# reversed sort facilitates efficient popping of earliest-starting interval
intervals.sort(reverse=True)
unique_intervals = []
while intervals:
# take the earliest remaining interval, then guarantee uniqueness
unique_interval = intervals.pop()
unique_intervals.append(unique_interval)
# scan the remaining intervals for overlap
# since we already have the earliest start, anything with an
# earler stop is redundant
redundant_intervals = [i for i, interval in enumerate(intervals)
if interval[1] <= unique_interval[1]]
# remove redundant intervals from the end or things get out of order
for i in sorted(redundant_intervals, reverse=True):
intervals.pop(i)
merged_intervals = []
while unique_intervals:
# since unique_intervals is reverse-sorted by construction,
# pop to get the latest ending interval
merged_interval = unique_intervals.pop()
# merge any unique intervals that overlap with it, starting with
# the next-latest ending interval
for start, stop in reversed(unique_intervals):
# having a stop time after the latest-ending interval start time
# defines overlap, meaning we should merge the intervals
if stop >= merged_interval[0]:
merged_interval[0] = start # merge by rewriting stop time
unique_intervals.pop() # and discarding the overlapper
else:
break # further iteration is unnecessary because of sorting
merged_intervals.append(merged_interval)
return sum(end-start for start, end in merged_intervals)
def better_answer(intervals):
''' if the interval numbers are not too big, this solution is awesomer
'''
monitored_times = set()
for interval in intervals:
monitored_times.update(range(*interval))
return len(monitored_times)