1D Players and a Watcher With Direction Switches

On a line segment from 0 to L, N players start at initial positions pos[i]. Each player tries to move to the right at a constant speed of 1 unit per second. A watcher also moves along the segment at the same speed, starting at w0 with an initial facing direction ("left" or "right"). The watcher toggles its direction at every time point in the unordered list switchTimes. Additionally, the watcher stays within the segment: if it reaches 0 or L, it reverses direction.

At any moment, a player is watched if the player lies in the direction the watcher is currently facing, relative to the watcher’s position:

• If the watcher faces right, it watches all players with position ≥ its current position.
• If the watcher faces left, it watches all players with position ≤ its current position.

A watched player is frozen and cannot move. The simulation runs from time 0 to T. A player reaches the goal when its position becomes ≥ L by time T. Return the number of players who achieve this.

Input

• L: integer, length of the segment (0 ≤ L)
• N: integer, number of players (0 ≤ N)
• pos: list of N integers, initial positions (0 ≤ pos[i] ≤ L)
• w0: integer, watcher’s initial position (0 ≤ w0 ≤ L)
• initialDir: string, either "left" or "right"
• switchTimes: list of K non‑negative integers, times at which the watcher toggles direction (unordered)
• T: integer, end time of the simulation

Output

• An integer: the count of players whose position is ≥ L at time T.

Constraints

• 0 ≤ L, N, K, T ≤ 10⁵ (or similar reasonable bounds)
• Players may share the same starting position.
• switchTimes may contain duplicates, zeros, and values larger than T; such entries have no extra effect.
• The watcher’s speed is exactly 1 unit per second, identical to the players’ speed.
• All movement is continuous; direction changes at switch times and at boundaries are instantaneous.

Examples

Example 1

L = 10, N = 2, pos = [2, 4], w0 = 0, initialDir = "right", switchTimes = [], T = 5
Output: 0

Explanation: The watcher starts at 0 facing right, watching all positions ≥ 0. Both players are initially watched and cannot move. As the watcher moves right, it passes the first player at time 2 (position 2) and the second at time 4 (position 4). After being passed, each player becomes unwatched (the watcher is now to their right, still facing right) and begins moving. Player 1 moves for 3 seconds reaching 5; player 2 moves for 1 second reaching 5. Neither reaches L = 10.

Example 2

L = 10, N = 1, pos = [0], w0 = 10, initialDir = "left", switchTimes = [], T = 10
Output: 0

Explanation: The watcher starts at 10 facing left, watching all positions ≤ 10. The single player at 0 is always watched (0 ≤ watcher’s position at all times), so it never moves. It stays at 0 and never reaches the goal.

Example 3

L = 5, N = 2, pos = [0, 4], w0 = 2, initialDir = "right", switchTimes = [1, 3], T = 5
Output: 1

Explanation:

• Time 0–1: watcher moves right from 2 to 3, facing right. Player at 0 is unwatched and walks to 1; player at 4 is watched and stays at 4.
• At t = 1: switch to left. Watcher is at 3, now facing left and watching ≤ 3. Player at 1 is watched (freezes), player at 4 becomes unwatched and starts moving.
• Time 1–3: watcher moves left from 3 to 1. Player at 4 runs to 6 (crossing L = 5 at t = 2) – goal reached. Player at 1 remains frozen.
• At t = 3: switch to right. Watcher is at 1, facing right, watching ≥ 1. Player at 1 is exactly at the boundary and watched, so still frozen.
• Time 3–5: watcher moves right from 1 to 3. When the watcher moves past 1, the player at 1 becomes unwatched and moves for the remaining time, ending at 3. It does not reach L. Only player 2 reaches the goal.