窗口
Time limit:1s
Memory limit:256MB
ac代码:
#include<bits/stdc++.h>
using namespace std;
int n,m,now,a,b,i;
struct ck{
int id;
int now;
int x1,y1,x2,y2;
}x[15];
bool cmp(ck a,ck b){
return a.now < b.now;
}
int main(){
cin>>n>>m,now = n + 1;
for(i = 1;i <= n;++i)
cin>>x[i].x1>>x[i].y1>>x[i].x2>>x[i].y2,x[i].id = x[i].now = i;
while(m--){
cin>>a>>b;
for(i = n;i >= 1;--i)
if(a >= x[i].x1 && a <= x[i].x2 && b >= x[i].y1 && b <= x[i].y2){
cout<<x[i].id<<"\n";x[i].now = now++;break;
}
if(i == 0)
cout<<"IGNORED\n";
else
sort(x + 1,x + n + 1,cmp);
}
return 0;
}