Submission #5448063

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const ll inf=1e9+7;

int n,m,s;
int main(){
  cin>>n>>m>>s;
  int l[m],r[m],p[s],q[s];
  rep(i,m) cin>>l[i]>>r[i];
  rep(i,s) cin>>p[i]>>q[i];

  int d[n+1][n+1];
  rep(i,n+1)
  rep(j,n+1) d[i][j]=0;

  rep(i,m){
    for(int j=1;j<=l[i];j++)
    for(int k=r[i];k<=n;k++) d[j][k]++;
  }

  rep(i,s) cout<<d[p[i]][q[i]]<<endl;
}

Submission Info

Judge Result