-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path911 Online Election.py
67 lines (54 loc) · 2.09 KB
/
911 Online Election.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
58
59
60
61
62
63
64
65
66
67
#!/usr/bin/python3
"""
In an election, the i-th vote was cast for persons[i] at time times[i].
Now, we would like to implement the following query function:
TopVotedCandidate.q(int t) will return the number of the person that was leading
the election at time t.
Votes cast at time t will count towards our query. In the case of a tie, the
most recent vote (among tied candidates) wins.
Example 1:
Input: ["TopVotedCandidate","q","q","q","q","q","q"], [[[0,1,1,0,0,1,0],
[0,5,10,15,20,25,30]],[3],[12],[25],[15],[24],[8]]
Output: [null,0,1,1,0,0,1]
Explanation:
At time 3, the votes are [0], and 0 is leading.
At time 12, the votes are [0,1,1], and 1 is leading.
At time 25, the votes are [0,1,1,0,0,1], and 1 is leading (as ties go to the
most recent vote.)
This continues for 3 more queries at time 15, 24, and 8.
Note:
1 <= persons.length = times.length <= 5000
0 <= persons[i] <= persons.length
times is a strictly increasing array with all elements in [0, 10^9].
TopVotedCandidate.q is called at most 10000 times per test case.
TopVotedCandidate.q(int t) is always called with t >= times[0].
"""
from typing import List
from collections import defaultdict
import bisect
class TopVotedCandidate:
def __init__(self, persons: List[int], times: List[int]):
"""
Running top vote
Need to maintain list
but time is too large to enumerate. Cannot have direct access, then
query is binary search
"""
self.maxes = [] # [(t, i)] at time t
counter = defaultdict(int)
tp = sorted(zip(times, persons))
for t, p in tp:
counter[p] += 1
if not self.maxes or counter[self.maxes[-1][1]] <= counter[p]:
self.maxes.append((t, p))
def q(self, t: int) -> int:
i = bisect.bisect(self.maxes, (t, 0))
# equal
if i < len(self.maxes) and self.maxes[i][0] == t:
return self.maxes[i][1]
# smaller
i -= 1
return self.maxes[i][1]
# Your TopVotedCandidate object will be instantiated and called as such:
# obj = TopVotedCandidate(persons, times)
# param_1 = obj.q(t)