### 295 - Fatman

Posted:

**Fri Oct 19, 2007 5:39 pm**Could anyone kindly give some test case?

I have no idea if my algorithm ok. Consider the sample input:

1

8 5

8

2 1

1 3

3 2

4 4

5 3

6 4

7 2

7 1

For each combination of obstacle(along x-axis), I consider a "tunnel" that is formed by "ceiling" and "floor", which are both series of segment.

Say ceiling is "(1,3) (2, 5) (3, 5) (4, 4) ..." and floor is "(1, 0) (2, 1) (3, 2) (4, 0)...." Then I output the minimum pairwise of the vertex forming the tunnel.

I have no idea if my algorithm ok. Consider the sample input:

1

8 5

8

2 1

1 3

3 2

4 4

5 3

6 4

7 2

7 1

For each combination of obstacle(along x-axis), I consider a "tunnel" that is formed by "ceiling" and "floor", which are both series of segment.

Say ceiling is "(1,3) (2, 5) (3, 5) (4, 4) ..." and floor is "(1, 0) (2, 1) (3, 2) (4, 0)...." Then I output the minimum pairwise of the vertex forming the tunnel.