Submission #1550955

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"

using namespace std;

const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;

long long int N, M, K, L, R, H, W;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> H >> W >> K;
	cin >> N;
	vector<int>sy(N);
	vector<int>sx(N);
	vector<int>gy(N);
	vector<int>gx(N);
	int num[51][51] = {};
	for (int i = 0; i < N; i++) {
		cin >> sy[i] >> gy[i] >> sx[i] >> gx[i];
		for (int j = sy[i]; j <= gy[i]; j++) {
			for (int k = sx[i]; k <= gx[i]; k++) {
				num[j][k]++;
			}
		}
	}
	for (int i = 0; i < N; i++) {
		int box = 0;
		for (int j = 1; j <= H; j++) {
			for (int k = 1; k <= W; k++) {
				if (sy[i] <= j&&j <= gy[i]&&sx[i] <= k&&k <= gx[i]) {
					if ((num[j][k] - 1) % 4 == 0)box++;
				}
				else {
					if (num[j][k] % 4 == 0)box++;
				}
			}
		}
		if (box == K) {
			cout << i + 1 << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result