56 lines
2.1 KiB
Python
56 lines
2.1 KiB
Python
import sys
|
|
import math
|
|
from collections import defaultdict
|
|
|
|
# Auto-generated code below aims at helping you parse
|
|
# the standard input according to the problem statement.
|
|
|
|
# nb_floors: number of floors
|
|
# width: width of the area
|
|
# nb_rounds: maximum number of rounds
|
|
# exit_floor: floor on which the exit is found
|
|
# exit_pos: position of the exit on its floor
|
|
# nb_total_clones: number of generated clones
|
|
# nb_additional_elevators: ignore (always zero)
|
|
# nb_elevators: number of elevators
|
|
nb_floors, width, nb_rounds, exit_floor, exit_pos, nb_total_clones, nb_additional_elevators, nb_elevators = [int(i) for
|
|
i in
|
|
input().split()]
|
|
elevators = defaultdict(int)
|
|
for i in range(nb_elevators):
|
|
# elevator_floor: floor on which this elevator is found
|
|
# elevator_pos: position of the elevator on its floor
|
|
elevator_floor, elevator_pos = [int(j) for j in input().split()]
|
|
elevators[elevator_floor] = elevator_pos
|
|
|
|
print(elevators, file=sys.stderr)
|
|
# game loop
|
|
while True:
|
|
# clone_floor: floor of the leading clone
|
|
# clone_pos: position of the leading clone on its floor
|
|
# direction: direction of the leading clone: LEFT or RIGHT
|
|
clone_floor, clone_pos, direction = input().split()
|
|
clone_floor = int(clone_floor)
|
|
clone_pos = int(clone_pos)
|
|
|
|
action = "WAIT"
|
|
|
|
if clone_pos == width - 1 or clone_pos == 0:
|
|
action = 'BLOCK'
|
|
elif clone_floor == exit_floor:
|
|
if clone_pos > exit_pos and direction == 'RIGHT':
|
|
action = 'BLOCK'
|
|
elif clone_pos < exit_pos and direction == 'LEFT':
|
|
action = 'BLOCK'
|
|
elif clone_pos > elevators[clone_floor] and direction == 'RIGHT':
|
|
action = 'BLOCK'
|
|
elif clone_pos < elevators[clone_floor] and direction == 'LEFT':
|
|
action = 'BLOCK'
|
|
|
|
print(action)
|
|
|
|
# Write an action using print
|
|
# To debug: print("Debug messages...", file=sys.stderr)
|
|
|
|
# action: WAIT or BLOCK
|