1103. Ice rink

单点时限: 2.0 sec

内存限制: 256 MB

A skating competition was organized on the largest icerink in Byteland. The icerink is a square of size 10000 * 10000. A competitor begins skating at the START point chosen by referees and his task is to finish sliding at the FINISH point, also chosen by referees. The points of START and FINISH are different. One can slide in directions parallel to the sides of the icerink. There are some obstacles placed on the icerink. Each obstacle is a prism, which base is a polygon with sides parallel to the sides of the icerink. Each two adjacent sides of the base are always perpendicular. The obstacles do not have common points. Each slide finishes up at the point where a competitor, for the first time, meets the wall of an obstacle, which is perpendicular to the direction of the slide. In other words, one can stop only when he crashes on a wall or in the FINISH point. Falling out of the icerink causes disqualification. Competitor may slide along walls of an obstacle.

Decide, whether a competitor who slides according to the given rules may reach the finish point, assuming he begun sliding from the starting point. If so, what is the minimal number of slides he needs to do?


Write a program which:

reads the description of the icerink, obstacles, and the coordinates of the start and finish point,

verifies, whether a competitor who begins from the starting point and slides according the rules may reach the finish point, and if so, computes the minimal number of slides he needs to do,

writes the result.


We define a system of coordinates to describe positions of objects on a rink. The rink is a square with vertices (0,0),(10000,0),(10000,10000),(0,10000). In the first line there are two integers z1 and z2 separated by a single space, 0<=z1, z2<=10000. The pair (z1, z2) denotes coordinates of the START point. In the second line of the file there are two integers t1 and t2 separated by single space, 0<=t1, t2<=10000. The pair (t1, t2) denotes coordinates of the FINISH point. The third line of the file contains one integer s, 1<=s<=2500. This is the number of obstacles. The following lines comprise descriptions of s obstacles. Each description of an obstacle begins with the line containing one positive integer r equal to the number of walls (sides of the base) of the obstacle. In each of the following r lines there are two integers x and y separated by a single space. These are the coordinates of the vertices of the obstacle’s base, given in a clockwise order. (i.e. when going around the obstacle in this direction the inside is on the left-hand side). The total number of side walls of the obstacles does not exceed 10000.


Your program should write in the only line of the output:

either one word ‘NIE’ (means “no” in Polish) if it’s impossible to get from the START point to the FINISH point

or the minimal number of slides necessary to get to the FINISH point, if it is possible.


40 10
5 40
0 15
0 60
20 60
20 55
5 55
5 15
30 55
30 60
60 60
60 0
0 0
0 5
55 5
55 35
50 35
50 40
55 40
55 55
30 25
15 25
15 30
35 30
35 15
30 15
describing the following configuration of obstacles:

1 人解决,3 人已尝试。

1 份提交通过,共有 31 份提交。

9.9 EMB 奖励。

创建: 16 年,10 月前.

修改: 6 年,9 月前.

最后提交: 3 年,6 月前.

来源: POI 1999 II Stage