Submission #402362

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


set<int> G[100005];

int main(){
  int R, C, K;
  int N;
  int r, c;
  cin >> R >> C >> K;
  cin >> N;
  vector<int> cntR(R,0), cntC(C,0);

  rep(i,N){
    cin >> r >> c;
    r--;
    c--;

    G[r].insert(c);
    cntR[r]++;
    cntC[c]++;
  }

  int ret = 0;

  map<int,int> memo;
  rep(i,cntC.size()){
    memo[cntC[i]]++;
  }
  
  rep(i,R){
    ret += memo[K-cntR[i]];
  }

  rep(i,R){
    FOR(itr,G[i]){
      r = i;
      c = *itr;

      if(cntR[r]+cntC[c]==K) ret--;
      if(cntR[r]+cntC[c]==K+1) ret++;
    }
  }

  cout << ret << endl;
  
  return 0;
}

Submission Info

Judge Result