窗口-CCF测试往届题

#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<math.h>
#include<limits.h>
#include<algorithm>
#include<memory.h>
#include<string.h>

using namespace std;

typedef struct wind
{
int r1, c1, r2, c2, num;
struct wind *next;
}windows;

int main()
{
int n = 0, m = 0, i = 0, j = 0;
int x, y;
cin >> n >> m;
windows *whead = (windows*)malloc(sizeof(windows));
memset(whead, 0, sizeof(windows));
whead->next = NULL;
windows *p = whead, *q = p->next,*tem=NULL;
for (i = 1; i <= n; i++)
{
tem= (windows*)malloc(sizeof(windows));
memset(tem, 0, sizeof(windows));
tem->next = whead->next;
cin >> tem->r1 >> tem->c1 >> tem->r2 >> tem->c2;
tem->num = i;
whead->next=tem;
}
p = whead, q = p->next;
for (i = 0; i < m; i++)
{
cin >> x >> y;
p = whead, q = p->next;
while(q != NULL)
{

if (x <= q->r2&&x >= q->r1&&y >= q->c1&&y <= q->c2)
{
cout <<q->num<< endl;
if (q !=whead->next)
{
p->next = q->next;
q->next = whead->next;
whead->next = q;
}
break;
}
p = q;
q = q->next;
}
if (q == NULL)cout << "IGNORED" << endl;
}
return 0;
}