TAXI - Taxi

In New Town all streets are built as straight lines intersecting at right angles at fixed distances, with the distance between intersections being a fixed 200 meters (see picture below).

Road map

One of of the major events in New Town is the New Town Festival and nearly everybody wants to get a ticket. To give everyone the same chance of getting one of the few tickets the place and time of the advance sale are kept secret until some minutes before the ticket counter opens. Once the opening of the ticket counter is disclosed (by radio to give everyone a fair chance) everyone interested in getting some tickets tries to get to the counter immediately.

One of the most profiting citizens of this ticket selling procedure is New Town's taxi service owner. At the time of the radio announcement all over the town people ring up the taxi central and ask for a ride. The problem for the taxi central is that a lot of people ask for a ride at the same time and that the taxis have to pick up the people very quickly.

Your task is to help the taxi central finding out how many passengers can be transported to the ticket counter. You have to adhere to following constraints:

  • each taxi can only take one passenger
  • passengers always wait at intersections of roads
  • at the time of the radio broadcast all taxis also wait at intersections
  • the taxi has to reach the passenger within a given time limit (otherwise he will be too late to get a ticket)


The first line contains the number of testcases k (k<=250). The first line of each testcase contains the number of persons p (1<=p<=400), the number of taxicabs t (1<=t<=200) the speed s (1<=s<=2000) of the taxis in meters per seconds and the time c to collect a person in seconds (1<=c<=1000000). The next p lines contains the position of the persons. The next t lines contain the position of the taxicabs in the city.


For each testcase output the maximal number of persons that can be picked up.


2 3 10 40
2 5
5 2
2 3
4 1
4 4


hide comments
nkrasimirov: 2020-05-21 16:28:54

Is this possible to solve with Dinic's algorithm in time, or is Hopcroft-Karp the only feasible solution?

aniketthecoder: 2019-06-12 13:26:45

What is the location of ticket counter?

sarwar__05: 2019-03-03 21:10:35

Poor problem statement :(

totallynotan: 2018-03-15 22:54:32

:D that time limit tho

vaibhavk31: 2017-06-02 21:34:28

Wow MBM is great
nice question :)
Enjoyed Solving it

bruzelee: 2017-01-05 14:20:57

take care of that 200 meters

SANYAM JAIN: 2016-08-06 12:26:37

my 100th :)

Superty: 2016-07-31 15:45:01

Be careful! The distance between two adjacent intersections is 200m!

minhthai: 2016-02-20 03:57:21

if I divide the distance by speed to get the time, I get WA...

sigma_poet: 2016-01-10 12:40:12

What does this problem means??? English is poor...

Added by:Simon
Time limit:22s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:Ulm Algorithm Course SoSe 2005