| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 94788 | hhhhhhhh | 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.
#include "treasure.h"
void find(int r1, int c1, int row_size, int col_size) {
if (row_size == 1 && col_size) {
if (countTreasure(r1, c1, r1, c1)) {
Report(r1, c1);
return;
}
}
int row_divide = row_size / 2, col_divide = col_size / 2;
int row_remain = row_size - row_divide, col_remain = col_size - col_divide;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 2; ++j) {
int new_r1 = r1 + row_divide * i, new_c1 = c1 + col_divide * j;
int new_row_size = (i == 0) ? row_divide : row_remain;
int new_col_size = (j == 0) ? col_divide : col_remain;
if (!countTreasure(new_r1, new_c1, new_r1 + new_row_size - 1, new_c1 + new_col_size - 1))
find(new_r1, new_c1, new_row_size, new_col_size);
}
}
}