Language: C++

// g++ macro.cpp -std=c++14
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
 
#define dump(x)  cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible"  ) << endl
 
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
 
#define FOREACH(x,a) for(auto& (x) : (a) )
 
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
 
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
 
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}
 
#define ALL(obj) (obj).begin(),(obj).end()
 
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
 
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
 
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
    seco.resize(head);
    VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
  VECCIN(head);
  VT2(move(tail)...);
}
 
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
  seco[head]=IN();
  VT3(head,move(tail)...);
}
 
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
 
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision; // cpp_int
 
#define P pair<ll,ll>
#define V vector<ll>
#define M map<ll,ll>
#define S set<ll>
 
#define pb(a) push_back(a)
#define mp make_pair
 
class RectangleSum{//O(HW)で初期化してO(1)で長方形の和を出す(半開区間)
  public:
  vector<V> sum;
  RectangleSum(vector<V>& v){
	  int h = v.size();
	  int w = v[0].size();

	  rui.resize(h + 1, V(w + 1, 0));

	  REP(i,h)REP(j,w)
		  rui[i+1][j+1] = v[i][j];

	  REP(i,h + 1)REP(j,w)
		  rui[i][j+1] = v[i][j];

	  REP(i,h)REP(j,w + 1)
		  rui[i + 1][j] = v[i][j];
  }
  ll getSum(int sx, int sy, int ex, int ey){
    return rui[ex][ey] + rui[sx][sy] - rui[sx][ey] - rui[ex][sy];
  }
};


 
 
 
int main(){
  CIN(n,m,q);
  VC2(m,l,r);
  VC2(q,a,b);
 
  vector<V> v(n, V(n,0));
  REP(i,m){
    --l[i];
    --r[i];
    ++v[l[i]][r[i]];
  }
 
  RectangleSum rs(v, n, n);
 
  REP(i,q){
    --a[i];
    --b[i];
 
    // lがa以降かつrがb以前のものを探せばよい
    COUT(rs.getSum(0, a[i], b[i]+1, n));
  }
 
  return 0;
}


Compiler output:
a.cc: In constructor 'RectangleSum::RectangleSum(std::vector<std::vector<long long int> >&)':
a.cc:95:11: error: 'rui' was not declared in this scope
   95 |           rui.resize(h + 1, V(w + 1, 0));
      |           ^~~
a.cc: In member function 'll RectangleSum::getSum(int, int, int, int)':
a.cc:107:12: error: 'rui' was not declared in this scope
  107 |     return rui[ex][ey] + rui[sx][sy] - rui[sx][ey] - rui[ex][sy];
      |            ^~~
a.cc: In function 'int main()':
a.cc:127:26: error: no matching function for call to 'RectangleSum::RectangleSum(std::vector<std::vector<long long int> >&, int&, int&)'
  127 |   RectangleSum rs(v, n, n);
      |                          ^
a.cc:91:3: note: candidate: 'RectangleSum::RectangleSum(std::vector<std::vector<long long int> >&)'
   91 |   RectangleSum(vector<V>& v){
      |   ^~~~~~~~~~~~
a.cc:91:3: note:   candidate expects 1 argument, 3 provided
a.cc:88:7: note: candidate: 'RectangleSum::RectangleSum(const RectangleSum&)'
   88 | class RectangleSum{//O(HW)で初期化してO(1)で長方形の和を出す(半開区間)
      |       ^~~~~~~~~~~~
a.cc:88:7: note:   candidate expects 1 argument, 3 provided
a.cc:88:7: note: candidate: 'RectangleSum::RectangleSum(RectangleSum&&)'
a.cc:88:7: note:   candidate expects 1 argument, 3 provided