|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||256 MB||7||4||3||50.000%|
Do you know what is the difference between a hotel and a motel? That’s right, the diffe rence is in the number of flies that live there. Norman is an owner of one of the more popular American motels, but his mother insists he turns it into a hotel. That’s exactly why Norman got a flyswatter (a fly-killing device) in the shape of a polygon with K edges as a Christmas present in 2016.
Wanting to meet his mother’s demands, Norman found himself in front of a window with N flies. Since Norman wouldn’t even harm a fly, he wants to know how many ways there are for him to hit the window with the flyswatter, without harming a single fly.
The window is a rectangle with its lower left vertex placed in the center of the coordinate system. After Norman’s blow to the window, the vertices of the polygon must lie on integer coordinates, and the flyswatter must be located within the window with all its area. A fly is considered hurt if it’s located on the vertex, edge or within the flyswatter. You can't rotate or flip the flyswatter.
The first line of input contains integers Xp , Yp and N (1 <= Xp , Yp <= 500, 0 <= N <= Xp *Yp ), the coordinates of the upper right corner of the window and the number of flies on the window, respectively.
Each of the following N lines contains two integers X and Y (0 < X < Xp , 0 < Y < Yp ), the coordinates of a fly on the window.
The following line contains the integer K (3 <= K <= 10000), the number of vertices of the flyswatter.
Each of the following K lines contains two integers Xi , Yi (-109 <= Xi , Yi <= 109 ), the ith vertex of the flyswatter. The flyswatter vertices are provided in order of joining lines, so neighbouring vertices are connected by a straight line.
You must output how many ways there are for Norman to hit the window with the flyswatter, without harming a single fly.
4 5 2 1 3 3 4 4 0 0 2 0 2 2 0 2
5 5 3 1 4 1 3 2 2 3 4 7 6 3 7 6
6 7 2 2 5 4 5 8 1 4 3 3 4 1 5 3 7 4 5 5 4 7 3 5