Submission #1943812

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) (x=min(x,y))
#define chmax(x,y) (x=max(x,y))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

#define N 5010
#define M 60
ll h, w, m, n;
ll a[N], b[N], c[N], d[N];
ll g[M][M];

void add(int i, int x){
	for(int j = a[i]; j < b[i]; j++)
		for(int k = c[i]; k < d[i]; k++)
			g[j][k] += x;
}

int main(){
	cin>>h>>w>>m>>n;
	rep(i, n){
		cin>>a[i]>>b[i]>>c[i]>>d[i];
		a[i]--; c[i]--;
	}
	rep(i, n) add(i, 1);
	rep(i, n){
		add(i, 3);
		ll cnt = 0;
		rep(j, h) rep(k, w) cnt += g[j][k]%4==0;
		if(cnt==m) cout<<i+1<<endl;
		add(i, 1);
	}
	return 0;
}

Submission Info

Judge Result