Submission #3041619

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
using namespace std;

int main()
{
	int32_t R, C, K, N;
	cin >> R >> C >> K >> N;

	vector<int32_t> rows(R), cols(C);
	std::fill(rows.begin(), rows.end(), 0);
	std::fill(cols.begin(), cols.end(), 0);

	vector<int32_t> r(N), c(N);
	for (int32_t i = 0; i < N; i++) {
		cin >> r[i] >> c[i];
		r[i]--;
		c[i]--;
		rows[r[i]]++;
		cols[c[i]]++;
	}

	vector<int32_t> cnt_row(K + 1);
	std::fill(cnt_row.begin(), cnt_row.end(), 0);
	for (int32_t i = 0; i < R; i++) {
		if (rows[i] > K)
			continue;
		cnt_row[rows[i]]++;
	}

	vector<int32_t> cnt_col(K + 1);
	std::fill(cnt_col.begin(), cnt_col.end(), 0);
	for (int32_t i = 0; i < C; i++) {
		if (cols[i] > K)
			continue;
		cnt_col[cols[i]]++;
	}

	int64_t res = 0;
	for (int32_t i = 0; i <= K; i++) {
		res += cnt_row[i] * cnt_col[K - i];
	}
	for (int32_t i = 0; i < N; i++) {
		if (rows[r[i]] + cols[c[i]] == K)
			res--;
		else if (rows[r[i]] + cols[c[i]] == K + 1)
			res++;
	}

	cout << res << endl;
	return 0;
}

Submission Info

Judge Result