ZOJ 2480 Simplest Task in Windows

点击打开链接

Simplest Task in Windows

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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.

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.

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.

Sample Input

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

Sample Output

0
0
-1

---

Author:  SHI, Xiaohan
Source:  Zhejiang Provincial Programming Contest 2005

题意是说有电脑屏幕上有n个窗口，编号分别为0到n-1，给你每个窗口的左上角坐标和右下角坐标，可能有的窗口会覆盖，窗口时从后往前给的，然后给你m个坐标，让你判读这个坐标点击在第几个窗口上，如果覆盖则输出最前面的窗口编号，如果没有点击在窗口上，则输出-1.

#include<stdio.h>
#include<string.h>
int dp[107][107];
int main()
{
    int n;
    while(scanf("%d",&n),n)
    {
        int a,b,c,d,m;
        memset(dp,-1,sizeof(dp));
        for(int i=0;i<n;i++)
        {
            scanf("%d%d%d%d",&a,&b,&c,&d);
            for(int j=a;j<=c;j++)
                for(int k=b;k<=d;k++)
                    dp[j][k]=i;
        }
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",dp[a][b]);
        }
    }
    return 0;
}