30分求调

#include <bits/stdc++.h>
using namespace std;

struct seat {
    int x, y;
    bool istian;
} seats[1000][1000];

struct ditan {
    int a, b, g, k;
} s[10000];

int aa[10000], ac = 0;
int cou = 0;

void sousuo(int a, int b, int g, int k) {
    for (int i = a; i <= g; i++) {
        for (int j = b; j <= k; j++) {
            seats[i][j].istian = true;
            aa[ac] = cou;
            ac++;
        }
    }
}

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> s[i].a >> s[i].b >> s[i].g >> s[i].k;
    }
    int x, y;
    cin >> x >> y;
    for (int i = 0; i < n; i++) {
        sousuo(s[i].a, s[i].b, s[i].g, s[i].k);
        cou++;
    }
    if (seats[x][y].istian==true) {
        cout<<aa[ac - 1]+1 << endl;
    } 
    return 0;
}