Submission #2216304

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define INF 1000000000
#define INFL 10000000000000000LL
#define pb push_back
#define ll long long int
#define P pair<ll, ll>


int main() {
  int r, c, k;
  cin >> r >> c >> k;
  int n;
  int R[r] = { }, C[c] = { };
  vector<P> v;
  cin >> n;
  REP(i, n){
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    R[x]++;
    C[y]++;
    v.pb({x, y});
  }
  map<int, vector<int>> mr, mc;
  REP(i, r) mr[R[i]].pb(i);
  REP(i, c) mc[C[i]].pb(i);
  ll ans = 0;
  REP(i, k+1){
    if(mr[i].size()){
      ans += mr[i].size()*mc[k-i].size();
    }
  }
  for(P p: v){
    if(R[p.first] + C[p.second] == k) ans--;
    if((R[p.first] + C[p.second]) == (k+1)) ans++;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result