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