Submission #401354

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int inf = 1000000000;
const int mod = 1000000007;
const double eps = 1e-9;
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1};

int main() {
	// cin.tie(0); // tie
	// ios::sync_with_stdio(false); // sync
	int R, C, K, N;
	cin >> R >> C >> K >> N;
	int room[R + 1][C + 1];
	int row[R + 1], col[C + 1];
	mset(room, 0);
	mset(row, 0);
	mset(col, 0);

	rep(i, N) {
		int r, c; cin >> r >> c;
		room[r - 1][c - 1] = 1;
		row[r - 1] += 1;
		col[c - 1] += 1;
	}

	int ans = 0;
	rep(i, R) rep(j, C) {
		int tmp = 0;
		tmp += row[i] + col[j];
		if (room[i][j] == 1) tmp--;
		if (tmp == K) ans++;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result