#include "treasure.h"
bool visit[101][101];
bool visit2[101][101];
void check(int a, int b, int c, int d) {
for (int i = a; i <= c; i++) {
for (int j = b; j <= d; j++) {
visit[i][j] = 1;
visit2[i][j] = 1;
}
}
}
int getCnt(int a, int b, int c, int d) {
int ret = 0;
for (int i = a; i <= c; i++) {
for (int j = b; j <= d; j++) {
if (visit[i][j] == 1) {
ret++;
}
}
}
return ret;
}
void go(int a, int b, int N, int C) {
int M = N % 2 == 0 ? N / 2 : (N / 2) + 1;
if (M == 1) {
if (visit2[a][b] == 0 && countTreasure(a, b, a, b) == 1) {
visit[a][b] = 1;
visit2[a][b] = 1;
C--;
if (C == 0)return;
}
if (visit2[a + 1][b] == 0 && countTreasure(a + 1, b, a + 1, b) == 1) {
visit[a + 1][b] = 1;
visit2[a + 1][b] = 1;
C--;
if (C == 0)return;
}
if (visit2[a][b + 1] == 0 && countTreasure(a, b + 1, a, b + 1) == 1) {
visit[a][b + 1] = 1;
visit2[a][b + 1] = 1;
C--;
if (C == 0)return;
}
if (visit2[a + 1][b + 1] == 0 && countTreasure(a + 1, b + 1, a + 1, b + 1) == 1) {
visit[a + 1][b + 1] = 1;
visit2[a + 1][b + 1] = 1;
C--;
if (C == 0)return;
}
return;
}
if (N % 2 == 0) {
int cnt = countTreasure(a, b, a + M - 1, b + M - 1);
int cnt2 = getCnt(a, b, a + M - 1, b + M - 1);
if (cnt == M * M) check(a, b, a + M - 1, b + M - 1);
else if(cnt != 0)go(a, b, M,cnt-cnt2);
cnt = countTreasure(a + M, b, a + (2 * M) - 1, b + M - 1);
cnt2 = getCnt(a + M, b, a + (2 * M) - 1, b + M - 1);
if (cnt == M * M) check(a + M, b, a + (2 * M) - 1, b + M - 1);
else if (cnt != 0)go(a + M, b, M, cnt-cnt2);
cnt = countTreasure(a, b + M, a + M - 1, b + (2 * M) - 1);
cnt2 = getCnt(a, b + M, a + M - 1, b + (2 * M) - 1);
if (cnt == M * M) check(a, b + M, a + M - 1, b + (2 * M) - 1);
else if (cnt != 0)go(a, b + M, M, cnt-cnt2);
cnt = countTreasure(a + M, b + M, a + (2 * M) - 1, b + (2 * M) - 1);
cnt2 = getCnt(a + M, b + M, a + (2 * M) - 1, b + (2 * M) - 1);
if (cnt == M * M) check(a + M, b + M, a + (2 * M) - 1, b + (2 * M) - 1);
else if (cnt != 0)go(a + M, b + M, M, cnt-cnt2);
}
else {
int cnt = countTreasure(a, b, a + M - 1, b + M - 1);
int cnt2 = getCnt(a, b, a + M - 1, b + M - 1);
if (cnt == M * M) check(a, b, a + M - 1, b + M - 1);
else if (cnt != 0)go(a, b, M, cnt-cnt2);
cnt = countTreasure(a + M - 1, b, a + (2 * M) - 2, b + M - 1);
cnt2 = getCnt(a + M - 1, b, a + (2 * M) - 2, b + M - 1);
if (cnt == M * M) check(a + M - 1, b, a + (2 * M) - 2, b + M - 1);
else if (cnt != 0)go(a + M - 1, b, M, cnt-cnt2);
cnt = countTreasure(a, b + M - 1, a + M - 1, b + (2 * M) - 2);
cnt2 = getCnt(a, b + M - 1, a + M - 1, b + (2 * M) - 2);
if (cnt == M * M) check(a, b + M - 1, a + M - 1, b + (2 * M) - 2);
else if (cnt != 0)go(a, b + M - 1, M, cnt-cnt2);
cnt = countTreasure(a + M - 1, b + M - 1, a + (2 * M) - 2, b + (2 * M) - 2);
cnt2 = getCnt(a + M - 1, b + M - 1, a + (2 * M) - 2, b + (2 * M) - 2);
if (cnt == M * M) check(a + M - 1, b + M - 1, a + (2 * M) - 2, b + (2 * M) - 2);
else if (cnt != 0)go(a + M - 1, b + M - 1, M, cnt-cnt2);
}
}
void findTreasure(int N) {
int cnt = countTreasure(1, 1, N, N);
if (cnt == 0) return;
else if (cnt == N * N) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
Report(i, j);
}
}
}
else {
go(1, 1, N,cnt);
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (visit[i][j] == 1) Report(i, j);
}
}
}
