Submission #1476135

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

int R, C, m, n;
int r1[5000], r2[5000], c1[5000], c2[5000];
int g[55][55];

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> R >> C >> m;
    cin >> n;
    rep(k, n) {
        cin >> r1[k] >> r2[k] >> c1[k] >> c2[k];
        r1[k]--; c1[k]--;
        rep2(i, r1[k], r2[k])rep2(j, c1[k], c2[k]) g[i][j]++;
    }
    rep(k, n) {
        int cnt = 0;
        rep2(i, r1[k], r2[k])rep2(j, c1[k], c2[k]) g[i][j]--;
        rep(i, R)rep(j, C) if (g[i][j] % 4 == 0) cnt++;
        rep2(i, r1[k], r2[k])rep2(j, c1[k], c2[k]) g[i][j]++;
        if (cnt == m) {
            cout << k + 1 << endl;
        }
    }
}

Submission Info

Judge Result