Submission #9819031

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rrep(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int a[505][505], s[505][505];

int main() {
    int N, M, Q;
    cin >> N >> M >> Q;

    rep(i, M) {
        int l, r; cin >> l >> r;
        a[l][r] += 1;
    }

    rep(i, Q) {
        int p, q; cin >> p >> q;
        int sum = 0;
        for (int j = p; j <= q; j++) {
            for (int k = p; k <= q; k++) {
                sum += a[j][k];
            }
        }
        cout << sum << endl;
    }
}

Submission Info

Judge Result