#include <bits/stdc++.h>
using namespace std;
int n, m,x,y,g,k,a,b;
int q[10000][10000];
int main()
{
cin >> n;
while (n--)
{
cin >> a >> b >> g >> k;
a++, b++;
for (int i=a;i<=a+g;i++)
for (int j=b;j<=b+k;j++)
{
q[i][j] += 1;
}
}
cin >> x >> y;
if (q[x+1][y+1]>0)
{
cout << q[x+1][y+1];
}
else
{
cout << -1;
}
}
分很低 数组越界了，有大佬有优化方法吗
