Submission #6926174

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define DEC(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const ll LINF = (int)1e18;
const double EPS = 1e-9;

signed main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  const int N_MAX = 510;
  const int M_MAX = 200010;

  int N,M,Q;
  cin>>N>>M>>Q;
  vector<int> L(M_MAX,0),R(M_MAX,0);
  
  int X[N_MAX][N_MAX],C[N_MAX][N_MAX];
  fill(X[0],X[N_MAX-1],0);
  fill(C[0],C[N_MAX-1],0);

  FOR(i,1,M+1) {
    cin>>L[i]>>R[i];
    ++X[L[i]][R[i]];
  }
  FOR(i,1,N+1)
    FOR(j,1,N+1) C[i][j] = C[i][j-1] + X[i][j];

  REP(i,Q) {
    int p,q;
    cin>>p>>q;
    int sum = 0;
    FOR(j,p,q+1) sum += C[j][q] - C[j][p-1];
    cout << sum << endl;
  }

  return 0;
}

Submission Info

Test Cases