#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int n;
bool ans[105][105];
int pref[105][105];
map<array<int, 4>, int> call;
int query(int x1, int y1, int x2, int y2) {
if (x1 > x2) swap(x1, x2);
if (y1 > y2) swap(y1, y2);
// cerr << x1 << " " << y1 << " " << x2 << " " << y2 << "\n";
if (x1 <= 0 || x2 <= 0 || x2 > n || x1 > n || y1 <= 0 || y1 > n || y2 <= 0 || y2 > n) return 0;
if (call.count({x1, y1, x2, y2})) {
return call[{x1, y1, x2, y2}];
}
return call[{x1, y1, x2, y2}] = countTreasure(x1, y1, x2, y2);
}
int quadrant(int x, int y, int dx[], int dy[]) {
vector<int> poss;
for(int i = 0; i < 4; i++) {
poss.push_back(abs(dx[i]-x) * abs(dy[i]-y));
}
return max_element(poss.begin(), poss.end()) - poss.begin();
}
void findTreasure (int N) {
n = N;
int dx[] = {1, n, 1, n};
int dy[] = {1, 1, n, n};
int mid = n/2;
for(int i = n; i >= 1; i--) {
for(int j = n; j >= 1; j--) {
int idx = quadrant(i, j, dx, dy);
if (i > mid && j > mid) {
pref[i][j] = query(1, 1, i, j);
} else if (i > mid) {
pref[i][j] = pref[i][n] - query(1, j+1, i, n);
} else if (j > mid) {
pref[i][j] = pref[n][j] - query(i+1, 1, n, j);
} else {
pref[i][j] = pref[n][j] + pref[i][n] + query(i+1, j+1, n, n) - pref[n][n];
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
ans[i][j] = (pref[i][j] - pref[i-1][j] - pref[i][j-1] + pref[i-1][j-1]);
if (ans[i][j]) {
Report(i, j);
}
// cerr << ans[i][j] << " ";
}
// cerr << "\n";
}
}
