forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtime-taken-to-cross-the-door.cpp
More file actions
32 lines (30 loc) · 1023 Bytes
/
Copy pathtime-taken-to-cross-the-door.cpp
File metadata and controls
32 lines (30 loc) · 1023 Bytes
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
// Time: O(n)
// Space: O(n)
// queue, simulation
class Solution {
public:
vector<int> timeTaken(vector<int>& arrival, vector<int>& state) {
enum {UNKNOWN = -1, ENTERING, EXITING};
vector<int> result(size(arrival));
int curr = numeric_limits<int>::min(), direction = UNKNOWN;
vector<queue<int>> q(2);
const auto& go_until = [&](int t) {
while (curr <= t && any_of(cbegin(q), cend(q), [](const auto& x) { return !empty(x); })) {
if (empty(q[direction])) {
direction ^= 1;
}
result[q[direction].front()] = curr++;
q[direction].pop();
}
};
for (int i = 0; i < size(arrival); ++i) {
go_until(arrival[i] - 1);
q[state[i]].emplace(i);
if (!(arrival[i] <= curr)) {
curr = arrival[i], direction = EXITING;
}
}
go_until(numeric_limits<int>::max());
return result;
}
};