Submission #3040635

---

Source Code Expand

#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
int main()
{
  int res,p,q,N,M,Q,L[200001],R[200001],sum[501][501];
  cin >> N >> M >> Q;
  REP(i,M)cin >> L[i] >> R[i];
  REP(i,501)REP(j,501)sum[i][j] = 0;
  REP(i,M)sum[L[i]][R[i]]++;
  for(int i=1;i<=N;i++)
    for(int j=1;j<=N;j++){
      sum[i][j] += sum[i][j-1];
    }
  REP(i,Q){
    res = 0;
    cin >> p >> q;
    for(int i=p;i<=q;i++)
      res += sum[i][q]-sum[i][p-1];
    cout << res << endl;
  }
}

Submission Info

Judge Result