版本1和2间的区别
于2006-03-11 16:47:48修订的的版本1
大小: 1743
编辑: czk
备注:
于2006-04-21 21:12:08修订的的版本2
大小: 1833
编辑: czk
备注:
删除的内容标记成这样。 加入的内容标记成这样。
行号 1: 行号 1:
## page was renamed from 程序设计练习28——zju2480——Simplest Task in Windows

Simplest Task in Windows

Time limit: 1 Seconds

Memory limit: 32768K

A typical windows platform may have several windows on the desktop. A user's operation may be as simple as a single click of the mouse. In the implementation of such a windows platform, one of the simplest tasks would be deciding which window had been clicked.

Given a serial of windows, for each mouse click, decide which window had been clicked. Please notice that windows may overlap, and the window on top would receive the click rather than others. And, we consider a window to be clicked even if the mouse is just on its edge/corner. For the sake of simplicity, we assume that a window will not be activated to the top by any click.

1. Input

The first part of input is a serial of windows. First an integer N (1 <= N <= 10) is given, indicating the number of windows. Then N lines follow, each containing four integers, x1, y1, x2, y2, (x1 < x2, y1 < y2) the coordinates of the upper-left and lower-right corners of a window. The windows are given in back-to-front order. N=0 signals the end of input.

The second part of input is a serial of mouse clicks. First an integer M (1 <= M <= 50) is given, indicating the number of mouse clicks. Then M lines follow, each containing two integers, x and y, the coordinates of a mouse click.

2. Output

For each mouse click in the input, output a single line containing the index (starting from 0) of the window which receives the click. If there is no such window, output "-1" in a line instead.

3. Sample Input

1
0 0 5 5
3
4 1
5 1
6 1
0

4. Sample Output

0
0
-1

http://acm.zju.edu.cn/show_problem.php?pid=2480


zju2480 (2008-02-23 15:36:32由localhost编辑)

ch3n2k.com | Copyright (c) 2004-2020 czk.