题解 P1003 [铺地毯]

#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;

vector<int> a, b, lenx, leny;
int n, x, y, set = 0;

void cover(int);

int main()
{
    cin >> n;
    int tmp;
    for (int i = 0; i < n; i++)
    {
        cin >> tmp;   a.push_back(tmp);
        cin >> tmp;   b.push_back(tmp);
        cin >> tmp;   lenx.push_back(tmp);
        cin >> tmp;   leny.push_back(tmp);
    }
    cin >> x >> y;
    for (int i = 0; i < n; i++)
        cover(i);

    if (set == 0) cout << -1;
    else          cout << set;

    return 0;
}
void cover(int k)
{
    int i = x - a[k], j = y - b[k];
    if (i >= 0 && i <= lenx[k] && j >= 0 && j <= leny[k])
        set = k + 1;
}