Submission #2559001

---

Source Code Expand

#include <iostream>
#include <vector>

using namespace std;
typedef pair<int, int> P;
const int MAX_N = 100010;
int rcnt[MAX_N], ccnt[MAX_N];
int _rcnt[MAX_N], _ccnt[MAX_N];
int main() {
    int R, C, r, c, k, n;
    vector<P> v;
    cin >> R >> C >> k >> n;
    for (int i=0;i<n;i++) {
        cin >> r >> c;
        r--;c--;
        rcnt[r]++;
        ccnt[c]++;
        v.push_back(P(r, c));
    }
    for (int i=0;i<R;i++) {
        _rcnt[rcnt[i]]++;
    }
    for (int i=0;i<C;i++) {
        _ccnt[ccnt[i]]++;
    }
    int cnt = 0;
    for (int i=0;i<=k;i++) {
        cnt += _rcnt[i] * _ccnt[k-i];
    }
    for (int i=0;i<n;i++) {
        int pcnt = rcnt[v[i].first] + ccnt[v[i].second];
        if (pcnt == k) {
            cnt--;
        } else if (pcnt == k + 1) {
            cnt++;
        }
    }
    cout << cnt << endl;
}

Submission Info

Judge Result