CCF window (Full Score code + problem solving idea) March 2, 2014

Problem description

Their thinking ：

The data range is very small , So direct pure simulation
Store the window in an array , Query whether the point is in the window from the top down each time , If in , Then the current window is output id, And put the window on the top

Code implementation

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 20;

int n, m;

struct windou
{
    
    int x1, y1, x2, y2;
    int id;
}w[N];

int Find(int x, int y) // Judge （x, y) In which window 
{
    
    for (int i = n; i > 0; i --)
    {
    
        if(x >= w[i].x1 && x <= w[i].x2 && y >= w[i].y1 && y <= w[i].y2)
            return i;
    }
    return -1;
}

void Move(int id) // Top the current window 
{
    
    auto temp = w[id];
    for (int i = id; i < n; i ++)
    {
    
        w[i] = w[i + 1];
    }
    w[n] = temp;
}

int main()
{
    
    cin >> n >> m;

    for (int i = 1; i <= n; i ++)
    {
    
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        w[i] = {
    x1, y1, x2, y2, i}; // Structure initialization 
    }

    while (m --)
    {
    
        int x, y;
        cin >> x >> y;
        int res = Find(x, y);
        if(res == -1)
        {
    
            cout << "IGNORED" << endl;
        }
        else
        {
    
            cout << w[res].id << endl;
            Move(res);
        }
    }
    return 0;
}