|Online Judge||Problem Set||Authors||Online Contests||User|
The brand new formula racing team Irarref needs your help! Irarref doesn't have any real good drivers but they want to dominate formula racing. Since fairness doesn't mean anything to them they are trying to build a fully automatic driving control which needs almost no driver interaction.
Before actually trying the automatic driving control on track and risking to crash their precious cars (they don't care much about their drivers), they want to test it in a computer simulation.
You have to simulate the movement of a car on a given track. To simplify the problem, cars can only move in 8 directions (horizontal, vertical, and diagonal) on cells of a regular 2-dimensional grid, where directions are encoded as follows:
Every turn the car executes exactly one of the following commands:
In any case, a car moves its speed value in cells in its current direction and crosses all cells in-between its old and new position. When a car accelerates or brakes, its speed is adjusted before the movement of the current turn. When a car turns, its direction is changed before the movement.
The racing track is a 2-dimensional regular grid, where every cell can be: road, non-road space (but still drivable), start/goal line (also road and drivable), or wall.
Every car starts with an initial speed of 0 and has a maximum speed which it cannot exceed. When a car hits non-road space its speed is reduced to 1 in the next turn but it completes the move of this turn with its current speed. When a car hits a wall it crashes, the simulation stops immediately and there will be no next turn.
Every car is alone on the track, so you do not have to check for car/car collisions.
The first line contains the number of scenarios.
For each scenario, the first line contains width w and height h of the racing track (1 <= w, h <= 1000).The following h lines contain the layout of the racing track where road, non-road-space, start/goal line, and wall are represented by "x", ".", "s", and "W", respectively. The upper left corner of the racing area is (0, 0), the lower right corner (w-1, h-1), where coordinates are given as pairs (x, y) where x-direction is horizontal and y-direction is vertical.
A line containing the number n of cars to simulate follows the track description. For every car there are two lines:
It is guaranteed that the initial car position is not on a wall. It is also guaranteed that the car does not leave the track area without crashing.
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. For every scenario print for ever car the following information:
Print a blank line after each scenario.
1 12 12 WWWWWWWWWWWW W...xxxx...W W..xxxxxx..W W.xxWWWWxx.W WxxWW..WWxxW WxxW....WxxW WssW....WxxW WxxWW..WWxxW W.xxWWWWxx.W W..xxxxxx..W W...xxxx...W WWWWWWWWWWWW 2 1 6 0 3 armmrarrmrrrbrmmb 1 5 0 4 ararmrramrmar
Scenario #1: 2 4 0 0 crossing startline: 2 6 0 1 13 5 11 5 2 crashed
TUD Programming Contest 2004, Darmstadt, Germany
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator