标签:
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <string> #include <cstdlib> #include <cmath> #include <iostream> #include <cstring> #include <set> #include <queue> #include <algorithm> #include <vector> #include <map> #include <cctype> #include <cmath> #include <stack> #include <list> #define frer freopen("in.txt", "r", stdin) #define frew freopen("out.txt", "w", stdout) using namespace std; typedef long long LL; typedef pair<int, int> P; const int INF = 0x3f3f3f3f; const double inf = 0x3f3f3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 1e3 + 5; const int mod = 1e9 + 7; const int dr[] = {-1, 1, 0, 0}; const int dc[] = {0, 0, 1, -1}; const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"}; int n, m; const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; inline int Min(int a, int b){ return a < b ? a : b; } inline int Max(int a, int b){ return a > b ? a : b; } inline LL Min(LL a, LL b){ return a < b ? a : b; } inline LL Max(LL a, LL b){ return a > b ? a : b; } inline bool is_in(int r, int c){ return r >= 0 && r < n && c >= 0 && c < m; } struct node{ int x1, y1, x2, y2; int id; }; vector<node> v; int main(){ while(cin >> n >> m){ node u; v.clear(); for(int i = 0; i < n; ++i){ cin >> u.x1 >> u.y1 >> u.x2 >> u.y2; u.id = i+1; v.push_back(u); } int x, y; while(m--){ cin >> x >> y; bool ok = false; vector<node> :: iterator it = v.end(); --it; while(true){ if(x >= it->x1 && x <= it->x2 && y >= it->y1 && y <= it->y2){ printf("%d\n", it->id); ok = true; node u = *it; v.erase(it); v.push_back(u); break; } if(it == v.begin()) break; --it; } if(!ok) puts("IGNORED"); } } return 0; }
标签:
原文地址:http://www.cnblogs.com/dwtfukgv/p/5819029.html