Uber hack tag Questions

Advertisement

#1 Round

There are n drivers and k batteries (k>=n). They lie on the x-axis such that no two Drivers and No two batteries lie at the same point. A battery and A Driver may lie at the same point. There is also a Pickup Location “p”.

Each driver needs to take a Battery and go to the pickup location. A battery once taken cannot be used by other Driver.Assume drivers move unit distance per second. If two drivers reach a Battery at the same Time then only one person can Take it.A driver can pass through battery without taking it.

You need to determine the minimum time needed for all n drivers to go to the pickup location after taking the battery.
Input:
n,k ,p,array a[i] containing n locations of driver and array b[i] containing k locations of battery
n<=1000
n<=k<=2000
1<=a[i],b[i],p<=1e9
Note: no two drivers or battery is at the same point but a driver and a battery can be at the same point.

#2 Round

Office Keys

There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key and then go to the office. Once a key is taken by somebody, it couldn’t be taken by anybody else.

You are to determine the minimum time needed for all n people to get to the office with keys. Assume that people move a unit distance per 1 second. If two people reach a key at the same time, only one of them can take the key. A person can pass through a point with a key without taking it.

Advertisement

Input
The first line contains three integers n, k and p (1 ≤ n ≤ 1 000, n ≤ k ≤ 2 000, 1 ≤ p ≤ 109) — the number of people, the number of keys and the office location.

The second line contains n distinct integers a1, a2, …, an (1 ≤ ai ≤ 109) — positions in which people are located initially. The positions are given in arbitrary order.

The third line contains k distinct integers b1, b2, …, bk (1 ≤ bj ≤ 109) — positions of the keys. The positions are given in arbitrary order.

Note that there can’t be more than one person or more than one key in the same point. A person and a key can be located in the same point.

Output
Print the minimum time (in seconds) needed for all n to reach the office with keys.

Examples
input
2 4 50
20 100
60 10 40 80
output
50
input
1 2 10
11
15 7
output
7
Note
In the first example, the person located at point 20 should take the key located at point 40 and go with it to the office located at point 50. He spends 30 seconds. The person located at point 100 can take the key located at point 80 and go to the office with it. He spends 50 seconds. Thus, after 50 seconds everybody is in the office with keys.

Advertisement

Leave a Reply

Your email address will not be published. Required fields are marked *

16 − two =

Share on Social Media