求解决方法

代码：

#include <bits/stdc++.h>
using namespace std;
#define l x
#define r y

struct xd
{
    int x;
    int y;
}a[9000];
int main()
{
    freopen("query.in","r",stdin);
    freopen("query.out","w",stdout);
    int n, q, x, y, m, p;
    cin >> n >> q;
    for(int i = 1;i <= n;i++)
    {
        cin >> x >> y;
        a[i].x = x;
        a[i].y = y;
    }
    while(q--)
    {
        cin >> m;
        if(m == 2)
        {
            cin >> p >> x >> y;
            a[p].x = x;
            a[p].y = y;
        }
        else
        {
            cin >> l >> r;
            p = 0;
            for(int i = l;i <= r;i++)
            {
                for(int j = l;j <= r;j++)
                {
                    if(a[i].x < a[j].x && a[i].y < a[j].y)
                    {
                        p++;
                    }
                }
            }
            cout << p << endl;
        }
    }
    return 0;
}

求解决方法