The Willy Memorial Program

Time Limit: 2 Seconds
Memory Limit: 65536 KB

Willy the spider used to live in the chemistry laboratory of Dr. Petro. He
used to wander about the lab pipes and sometimes inside empty ones. One night
while he was in a pipe, he fell asleep. The next morning, Dr. Petro came to
the lab. He didn't notice Willy while opening the valve to fill the pipes with
hot water. Meanwhile, Stanley the gray mouse got what was going to happen. No
time to lose! Stan ran hard to reach the valve before Willy gets drawn, but...
Alas! He couldn't make it!

Poor Willy was boiled in hot water, but his memory is still in our hearts. Though
Stan tried his best, we want to write a program, in the memory of Willy, to
compute the time Stan had, to rescue Willy, assuming he started to run just
when the doctor opened the valve.

To simplify the problem, assume the pipes are all vertical cylinders with diameter
1 cm. Every pipe is open from the top and closed at the bottom. Some of the
pipes are connected through special horizontal pipes named links. The links
have very high flow capacity, but are so tiny that at any given time, the volume
of water inside them is negligible. The water enters from top of one of the
pipes with a constant rate of 0.25�� cm3/sec and begins to fill the pipe from
the bottom until the water reaches a link through which it flows horizontally
and begins to fill the connected pipe. From elementary physics we know if two
pipes are connected and the surface of the water is above the connecting link,
the level of water in both pipes remains the same when we try to fill one of
them. In this case the water fills each pipe with a rate equal to half of the
rate of incoming water. As an example, consider the following configuration:

First, the lower 2 centimeters of the left pipe is filled with water at full
rate, then, the lower 3 centimeters of the right pipe is filled, and after that,
the upper part of the two pipes are filled in parallel at half rate. The input
to your program is a configuration of pipes and links, and a target level in
one of the pipes (the heavy dotted line in the above figure). The program should
report how long it takes for the level of water to reach the target level. For
the above configuration, the output is 9 seconds.

It is assumed that the water falls very rapidly, such that the time required
for the water to fall can be neglected. The target level is always assumed to
be a bit higher than the specified level for it. As an example, if we set the
target point to level 4 in the left pipe in the figure above, the elapsed time
for water to reach that target is assumed to be 5 (not 2), Also note that if
the water reaches to the top of a pipe (say in level x), it won't pour out outside
the pipe until empty spaces in connected pipes below level x are filled (if
can be filled, i.e. the level of water reaches the connecting links). (Note
that there may be some links at level x, to which water is entered). After all
such spaces are filled; the water level would not go up further.

**Input**

To describe positions, we assume the coordinates are expressed as (x, y) and
the origin lies in the top-left of all pipes and links. (Note that y coordinates
are increased downwards). All coordinates are integer numbers between 0 and
100, inclusive.

The first line of the input file contains a single integer t (1 <= t <= 10), the
number of test cases, followed by the input data for each test case. The first
line of each test case is p (1 <= p <= 20), the number of pipes, followed by p
lines, each describing a pipe. Each pipe description line consists of three
numbers. The first two are (x, y) coordinates of the upper-left corner of the
pipe and the third number is the height of the pipe (at least 1 cm and at most
20 cm). Note that diameter of each pipe is 1 cm.

After input data describing the pipes, there is a line containing a single integer
l, which is the number of links (0 <= l <= 50). After it, there are l lines describing
links. Each link description contains 3 integers. The first two are (x, y) coordinates
of the left end-point of the link and the third is the length of the link (at
least 1 cm and at most 20 cm). It is assumed that the width of the link is zero.

The last line for each test case contains two numbers. The first is the number
of target pipe (starting from one, with the order appeared in test data). The
second line is the desired y for the level of water in the target pipe (note
that the specified level may be out of the pipe at all).

You can assume the following about the input:

The water enters into the first pipe.

No link crosses a pipe.

No two links have the same y coordinates.

No two pipes have the same upper-left x coordinates.

Both endpoints of each link are connected to pipes.

**Output**

The output should contain exactly t lines with no blank lines in between, each
corresponding to one test case. Each output line should contain the time required
for the water to reach the target level in the target pipe (an integer number).
If in a specific test case, the water never reaches the target level, the line
should contain No Solution string in it.

**Sample Input**

1

2

2 0 6

5 1 6

1

3 4 2

2 2

**Sample Output**

9

Source:

**Asia 2001, Tehran (Iran)**
Submit
Status