# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39448 | ykmyou | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int tCnt[102][102];
void findTreasure (int N) {
int mid = N / 2;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i <= mid) {
if (j <= mid) // 1 사분면
tCnt[i][j] = countTreasure(i, j, N, N);
else // 2 사분면
tCnt[i][j] = tCnt[i][1] - countTreasure(i, 1, N, j - 1);
}
else {
if (j <= mid) // 3 사분면
tCnt[i][j] = tCnt[1][j] - countTreasure(1, j, i - 1, N);
else // 4 사분면
tCnt[i][j] = (tCnt[i][1] + tCnt[1][j] + countTreasure(1, 1, i - 1, j - 1)) - tCnt[1][1];
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (tCnt[i][j] + tCnt[i + 1][j + 1] - (tCnt[i][j + 1] + tCnt[i + 1][j]))
Report(i, j);
}
}
}