# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41267 | kdk8361 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 824 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"
int s[101][101], i, j;
void findTreasure (int N) {
for (i = N / 2 + 1; i <= N; ++i) for (j = N / 2 + 1; j <= N; ++j)
s[i][j] = countTreasure(1, 1, i, j);
for (i = N / 2 + 1; i <= N; ++i) for (j = 1; j <= N / 2; ++j)
s[i][j] = s[i][N] - countTreasure(1, j + 1, i, N);
for (i = 1; i <= N / 2; ++i) for (j = N / 2 + 1; j <= N; ++j)
s[i][j] = s[N][j] - countTreasure(i + 1, 1, N, j);
for (i = 1; i <= N / 2; ++i) for (j = 1; j <= N / 2; ++j)
s[i][j] = s[i][N] + s[N][j] + countTreasure(i + 1, j + 1, N, N) - s[N][N];
for (i = 1; i <= N; ++i) for (j = 1; j <= N; ++j)
if (s[i][j] - s[i - 1][j] - s[i][j - 1] + s[i - 1][j - 1]) Report(i, j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |