1308. Window

单点时限: 2.0 sec

内存限制: 256 MB

Task

Write a program that:

1.reads descriptions of a window and a polygon;

2.computes the number of separate red fragments of the polygon that can be seen through the window;

3.writes the result.

输入格式

In the first line of the input file OKN.IN there are four integers x1, y1, x2, y2 from the range [0..10000], separated by single spaces. The numbers x1, y1 are the coordinates of the top-left corner of the window. The numbers x2, y2 are the coordinates of the bottom-right corner of the window. The next line of the input file contains one integer n, 4<=n<=5000, which equals the number of vertices of the polygon. In the following n lines there are coordinates of polygon’s vertices given in anticlockwise direction, i.e the interior of the polygon is on the left side of its periphery when we move along the sides of the polygon according to the given order. Each line contains two integers x, y separated by a single space, 0<=x<=10000, 0<=y<=10000. The numbers in the (i+2)-nd line of the file OKN.IN, 1<=i<=n, are coordinates of the i-th vertex of the polygon.

输出格式

In the first and only line of the output file OKN.OUT there should be one integer - the number of separate red fragments of the polygon that can be seen through the window.

样例

Input
0 5 8 1
24
0 0
4 0
4 2
5 2
5 0
7 0
7 3
3 3
3 2
2 2
2 4
1 4
1 5
2 5
2 6
3 6
3 5
4 5
4 6
5 6
5 4
7 4
7 7
0 7
Output
2

0 人解决,1 人已尝试。

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

9.9 EMB 奖励。

创建: 16 年,9 月前.

修改: 6 年,8 月前.

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

来源: POI 1998 II Stage

题目标签