Codeforces E. Counting Rectangles

题意：给出一些矩形的长和宽，要求求出每一个查询的长宽范围内的矩形的面积之和

思路：注意到h<=2000&&w<=2000，二维前缀和

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 998244353;
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
ll sq[2100][2100];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll mod) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

inline void init() {}

void slove()
{
    pre(i, 0, 2000)
        pre(j, 0, 2000)
            sq[i][j] = 0;
    cin >> n >> m;
    int x, y;
    pre(i, 1, n) {
        cin >> x >> y;
        sq[x][y] += 1ll * x * y;
    }

    pre(i, 1, 2000)
        pre(j, 1, 2000)
            sq[i][j] += sq[i - 1][j] + sq[i][j - 1] - sq[i - 1][j - 1];

    while (m--)
    {
        int hs, hb, ws, wb;
        cin >> hs >> ws >> hb >> wb;
        hb--, wb--, ws++, hs++;
        cout << sq[hb][wb] - sq[hs - 1][wb] - sq[hb][ws - 1] + sq[hs - 1][ws - 1] << endl;
    }
    return;
}

signed main()
{
    //IOS;
    int _;
    si(_);
    //_ = 1;
    init();
    while (_--)
    {
        slove();
    }
    return 0;
}